#include <stdio.h>
#include <string.h>
#include <sys/types.h> 
#include <sys/stat.h> 
#include <fcntl.h>
#include <stdlib.h>
#include <math.h>
#include <stdint.h>

#define TRUE  (1 == 1)
#define FALSE (1 != 1)

#define DEBUG if (FALSE)

#define UPPERLIMIT 32000
#define MAXPRIMES 3500

/* fprintf(stderr, "functionName: message", varslist); */

/*
 *  Author:
 *    Date:
 * Purpose:
 * Problem:
 */

/*
 * This template reads data a specified number of times.
 */

int numberOfTimes;
int num;

int primeCnt;
int a[UPPERLIMIT];
int p[MAXPRIMES];
int ans[MAXPRIMES];
int ansCnt;

int init()
 { /* FUNCTION init */
    int i;
    int j;

    scanf("%d` ", &numberOfTimes);
/* load p via Sieve of Erasthones */
    primeCnt = 0;
    for (i=0; i< UPPERLIMIT; i++) a[i] = i;
    for (i=2; i<UPPERLIMIT; i++)
     { /* for */
        if (0 != a[i])
         { /* found a prime */
            p[primeCnt] = i;
            primeCnt++;
            for (j=i*2; j < UPPERLIMIT; j=j+i) a[j] = 0;
         } /* found a prime */
     } /* for */
printf("numbr of primes %d\n", primeCnt);
 } /* FUNCTION init */

void dump()
 { /* FUNCTION dump */
 } /* FUNCTION dump */

void getInput()
 { /* FUNCTION getInput */
    scanf("%d ", &num);
 } /* FUNCTION getInput */

void process()
 { /* FUNCTION process */
    int i;

    ansCnt = 0;
    for (i=0; (p[i]<((2+num)/2)); i++)
     { /* for */
        DEBUG printf("%d - %d = %d %d\n", num, p[i], num - p[i], a[ num - p[i]]);
        if (0 != a[num - p[i]])
         { /* found answer */
            ans[ansCnt++] = p[i];
         } /* found answer */
     } /* for */
    printf("%d has %d representation(s)\n", num, ansCnt);
    for (i=0; i<ansCnt; i++)
     { /* print each answer */
        printf("%d+%d\n", ans[i], num-ans[i]);
     } /* print each answer */
 } /* FUNCTION process */

int main ()
 { /* main */
    int i;

    init();
    for (i=0; i<numberOfTimes; i++)
     { /* while */
        getInput();
        process();
     } /* while */

    return EXIT_SUCCESS;
 } /* main */