#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>

using namespace std;

typedef long long LL;
typedef long long ll;

inline LL quick_mul(LL a,LL b,LL m) //快速乘 
{
    ll ans = 0;
    a %= m;
    b %= m;
    while (b) {
        if (b & 1) {
            ans = (ans + a) % m;
        }
        a = (a + a) % m;
        b >>= 1;
    }
    return ans;
}

LL quick_pow(LL a,LL b,LL m) //快速幂 
{
    LL res=1;
    a%=m;
    while(b)
    {
        if(b&1) res=quick_mul(res,a,m);
        a=quick_mul(a,a,m);
        b>>=1;
    }
    return res;
}
bool Miller_rabin(LL n,int num)
{
//先将特殊情况判断一下
    if(n==2||n==3) return true;
    if(n%2==0||n==1) return false;
    srand((unsigned)time(NULL)); //为接下来a的随机取值用 
    LL d=n-1;
    int s=0;
    while(!(d&1)) s++,d>>=1;//若d的二进制的最后一位不是1，则说明d还是偶数 
    for(int i=0;i<num;i++)
    {
        LL a=rand()%(n-2)+2;//2~n-1;
        LL x=quick_pow(a,d,n), y=0;
        for(int j=0;j<s;j++)//一共平方s次 
        {
            y=quick_mul(x,x,n);//先平方 
            if(y==1&&x!=1&&x!=(n-1)) return false;//验证二次探测原理 
            x=y;
        }
        if(y!=1) return false;//不满足费马小定理，那就肯定不是质数
    }
    return true;
}
ll n;

bool  isSqrt(ll t)
{
for (ll  i = 1 ;t > 0 ;i += 2 ) t -= i;
return   0   ==  t;
}

void solve()
{
	cin>>n;
	if(n % 4 == 0)
	{
		cout<<"Even"<<'\n';
	}
	
	if(n % 2 == 0 && n % 4 != 0)
	{
		cout<<"Same"<<'\n';
	}
	
	if(n % 2 != 0)
	{
		cout<<"Odd"<<'\n';
	}
}

int main(void)
{
	int t = 1;
	cin>>t;
	while(t--)
	solve();
	return 0;
}
#include <iostream>
using namespace std;
int main() {
  int t;
  cin>>t;
  for(int i=0;i<t;i++){
    long long  num ;
    cin >> num;
     if (num%4==0){
      cout<<"Even"<<endl;
      continue;
    }
    if(num % 2==1){
      cout<<"Odd"<<endl;
      continue;
    }
    else{
      cout<<"Same"<<endl;
      continue;
    }
  }
}