#include <cstdio>
#define int long long
int read()
{
	int x=0,f=1;char c;
	while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
	while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return x*f;
}
int T,n,cnt; 
signed main()
{
	T=read();
	while(T--)
	{
		n=read();cnt=0;
		while(n%2==0) n/=2,cnt++;
		if(cnt==0) puts("Odd");
		else if(cnt==1) puts("Same");
		else puts("Even");
	}
}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int,int>::iterator
#define sit set<int>::iterator
#define itrm(g,x) for(mit g=x.begin();g!=x.end();g++)
#define itrs(g,x) for(sit g=x.begin();g!=x.end();g++)
#define ltype int
#define rep(i,j,k) for(ltype(i)=(j);(i)<=(k);(i)++)
#define rap(i,j,k) for(ltype(i)=(j);(i)<(k);(i)++)
#define per(i,j,k) for(ltype(i)=(j);(i)>=(k);(i)--)
#define pii pair<int,int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
#define check(x) if(x>=mod) x-=mod
const int inf=0x3f3f3f3f,mod=1000000007;
const double pi=3.1415926535897932,eps=1e-6;
void chmax(int &x,int y){if(x < y) x = y;}
void chmin(int &x,int y){if(x > y) x = y;}
int qpow(int x,int y){
    int ret = 1;
    while(y) {
        if(y & 1) ret = (ll)ret * x % mod;
        x = (ll)x * x % mod;
        y >>= 1;
    }
    return ret;
}
int N,n;
vector<string> v[10];
int main()
{
    fastio;
    cin>>N;
    /*n = 1 << N;
    int a = n * (n - 1) / 2;
    int b = (n / 2) * (n / 2 - 1);
    int lcm = a/gcd(a,b)*b;*/
    /*printf("%d %d %d %d %d\n",a,b,lcm,lcm/a,lcm/b);
    v.pb(0b11001100);
    v.pb(0b11000011);
    v.pb(0b10101010);
    v.pb(0b10100101);
    v.pb(0b10011001);
    v.pb(0b10010110);
    int nn = v.size();
    rap(i,0,nn) v.pb(255^v[i]);
    rap(i,0,v.size()){
        int x = v[i];
        rap(j,0,n) rap(k,0,n) if(((1<<j)&x) && ((1<<k)&x)) {
            //printf("%d %d\n",j,k);
            deg[j][k]++;
        }
    }
    rap(i,0,n) rap(j,i+1,n) if(deg[i][j] < 3) printf("%d %d\n",i,j);*/
    //int times = lcm / b;
    rep(i,1,8) {
        int ii = (1<<i);
        rap(j,0,v[i-1].size()){
            string s = v[i-1][j];
            string t = s + s;
            v[i].pb(t);
            t = s;
            rap(k,0,s.size()) s[k] = 131 - s[k];
            t += s;
            v[i].pb(t);
        }
        string s;
        rap(i,0,ii/2) s += 'A';
        rap(i,0,ii/2) s += 'B';
        v[i].pb(s);
    }
    cout<<v[N].size()<<endl;
    rap(i,0,v[N].size()) cout<<v[N][i]<<'\n';
    return 0;
}