#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int t;
    long long int c;
    cin>>t;
    for(int i=0;i<t;i++){
        cin>>c;
        if(c%4==0)cout<<"Even";
        else if(c%2==0)cout<<"Same";
        else cout<<"Odd";
        cout<<endl;
    }
}

//Bismillahir Rahmanir Raheem
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define lli long long int
#define ll64 int64_t
#define pb push_back
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define frr(i,a) for(int i=0;i<a;i++)
#define frl(i,a) for(lli i=0;i<a;i++)
#define fr1(i,a) for(int i=1;i<=a;i++)
#define iter(x)  x.begin(),x.end()
#define Memset(a,x,n) for(int i=0;i<n;i++)a[i]=x;
#define fi first
#define si second
//lower_bound returns an iterator pointing to the first element in the range [first,last) which has a value not less than ‘val’.
//upper_bound returns an iterator pointing to the first element in the range [first,last) which has a value greater than ‘val’.
typedef pair<lli,lli>pll;
void solve()
{
    lli n;
    cin>>n;
    if(n%2==1)
    {
        cout<<"Odd"<<endl;
        return;
    }
    lli c=0;
    while(n%2==0)
    {
        n/=2;
        c++;
    }

    if(c==1)
    {
        cout<<"Same"<<endl;
    }
    else
    {
        cout<<"Even"<<endl;
    }

}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}
