#include <cstdio>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;

typedef complex<double> P;
#define N 12
#define eps 1e-8

vector<pair<int,int> > ans;
int n;
int vs[N];

int conv(double x) {
	if (x<0) return -conv(-x);
	return (int)(x+0.5);
}

void check(P x) {
	P y(1,0);
	P sum=0;
	for (int i=0;i<n;++i) {
		sum+=P(vs[i],0)*y;
		y*=x;
	}
	if (abs(sum)<eps) {
		ans.push_back(make_pair(conv(real(x)),conv(imag(x))));
	}
}

int main() {
	scanf("%d",&n);
	++n;
	for (int i=0;i<n;++i) scanf("%d",vs+i);

	int s=0;
	while(vs[s]==0) ++s;
	check(P(0,0));

	int c=abs(vs[s]);
	for (int d=1;d*d<=c;++d) {
		if (c%d==0) {
			check(P(d,0));
			check(P(-d,0));
			check(P(c/d,0));
			check(P(-c/d,0));

			for (int a=0;a*a<=d;++a) {
				int b=(int)(sqrt(d-a*a)+eps);
				if (a*a+b*b==d) {
					check(P(a,b));
					check(P(a,-b));
					check(P(-a,b));
					check(P(-a,-b));
				}
			}
			for (int a=0;a*a<=c/d;++a) {
				int b=(int)(sqrt(c/d-a*a)+eps);
				if (a*a+b*b==c/d) {
					check(P(a,b));
					check(P(a,-b));
					check(P(-a,b));
					check(P(-a,-b));
				}
			}
		}
	}

	sort(ans.begin(),ans.end());
	ans.erase(unique(ans.begin(),ans.end()),ans.end());
	printf("%d\n",ans.size());
	for (int i=0;i<ans.size();++i) {
		if (i) putchar(' ');
		if (ans[i].first==0&&ans[i].second==0) {
			putchar('0');
		} else {
			if (ans[i].first!=0) printf("%d",ans[i].first);
			if (ans[i].second==0) continue;
			if (ans[i].first!=0||ans[i].second<0)	putchar(ans[i].second>0?'+':'-');
			if (abs(ans[i].second)!=1) printf("%d",abs(ans[i].second));
			putchar('i');
		}
	}
	puts("");
}