#include <cstdio>
#include <cstring>
#include <algorithm>
#define reg register
typedef long long ll;
const int N=1400;
ll f[N]={0,1},n,x,y;
ll g[N][2];
int st[N],opt[N],tot,top;
ll R()
{
	reg ll x=0; reg bool f=0; reg char ch=getchar();
	for(;ch<48||ch>57;ch=getchar()) f|=(ch=='-');
	for(;ch>=48&&ch<=57;ch=getchar()) x=x*10+ch-48;
	return f?-x:x;
}
int main() {
	n=R();
	if(n==1) return puts("1\n1"),0;
	reg int p=1,i;
	reg bool now=0;
	while(1) {
		f[p+1]=f[p]+f[p-1];
		if(f[p+1]>n) break;
		++p;
	}
	for(i=p;i;--i)
		if(n>=f[i]) n-=f[i],st[++top]=i;
		/*
		now=0,x=0,y=1,plan to do x=x+y
		now=1,x=1,y=0,plan to do y=x+y
		*/
	x=0,y=1;
	for(i=1;i<=p+2;++i) {
		(i&1)?x=x+y:y=x+y;
		g[i][0]=x;
	}
	g[0][1]=x=1,y=0;
	for(i=1;i<=p+2;++i) {
		(i&1)?y=x+y:x=x+y;
		g[i][1]=x;
	}
	for(i=0;top;++i) {
		now^=1;
		if(g[i][now]==f[st[top]]) opt[++tot]=2-now,--top;
		opt[++tot]=4-now;
	}
	while(opt[tot]>=3) --tot;
	printf("%d\n",tot);
	x=y=0;
	for(i=tot;i;--i) {
		printf("%d\n",opt[i]);
	/*	if(opt[i]==1) ++x;
		if(opt[i]==2) ++y;
		if(opt[i]==3) x=x+y;
		if(opt[i]==4) y=x+y; */
	}
//	printf("end:%lld %lld\n",x,y);
}

/**
 *    Coded by : lucky_21
 *               --------Lokesh Singh
**/

#include<bits/stdc++.h>
using namespace std;

#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

#define     F           first
#define     S           second
#define     pb          push_back
#define     lb          lower_bound
#define     ub          upper_bound
#define     vi          vector<int>
#define     all(x)      x.begin(),x.end()
#define     fix         fixed<<setprecision(10)
#define     rep(i,a,b)  for(int i=int(a);i<=int(b);i++)
#define     repb(i,b,a) for(int i=int(b);i>=int(a);i--)
#define     FastIO      ios_base::sync_with_stdio(0),cin.tie(0)

typedef double db;
typedef long long ll;

const int N=2e5+5;
const int mod=1e9+7;

void solve(){
    ll n;
    cin>>n;
    int cnt=0;
    while(n%2==0) n/=2,cnt++;
    if(!cnt) cout<<"Odd\n";
    else if(cnt==1) cout<<"Same\n";
    else cout<<"Even\n";
}

signed main(){
    FastIO;
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}
