#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) (a).begin(),(a).end()
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
mt19937 rnd(time(0));
const int M=1.3e5+10,N=2e6,Q=1e3+10;
int q,a[Q],id[N];
uint f[M];
vector<int>ans[Q];
int rd(int l,int r){
	return rnd()%(r-l+1)+l;
}
int main(){
	scanf("%d",&q);
	for(int i=1;i<=q;i++)scanf("%d",&a[i]);
	int T=0;
	set<int>ret;
	for(int i=1;i<=q;i++)ret.insert(i);
	for(;!ret.empty();T++){
		memset(f,0,sizeof f);
		int m=1.5e3,n=29,sum=0;
		vector<int>p{0,m};
		for(int i=1;i<n;i++){
			int x;
			do x=rd(1,m);while(find(all(p),x)!=p.end());
			p.push_back(x);
		}
		sort(all(p));
		f[0]=1;
		vector<int>num;
		for(int i=1;i<=n;i++){
			int x=p[i]-p[i-1];
			sum+=x;
			for(int j=sum;j>=x;j--)f[j]+=f[j-x];
			num.push_back(x);
		}
		for(int i=0;i<=sum;i++)id[f[i]+1]=i;
		for(auto it=ret.begin();it!=ret.end();){
			int i=*it;
			if(id[a[i]])ans[i]=num,ans[i].push_back(-id[a[i]]),it=ret.erase(it);
			else ++it;
		}
	}
	for(int i=1;i<=q;i++){
		printf("%ld\n",ans[i].size());
		for(int x:ans[i])printf("%d ",x);
		puts("");
	}
	debug(T,1.0*clock()/CLOCKS_PER_SEC);
	return 0;
}