#include<bits/stdc++.h>
#define ll long long 

int main()
{
    using namespace std;
    int t;
    cin>>t;
    while(t--)
    {
    	ll n;
    	cin>>n;
    	if(n==1)
    	{
    		cout<<"Odd\n";
    		continue;
    	}
    	if(n==2)
    	{
    		cout<<"Same\n";
    		continue;
    	}
        if(n%2==1)cout<<"Odd\n";
        else if(n%4==0)cout<<"Even\n";
        else if(n%4==2)cout<<"Same\n";
    }
    return 0;
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __builtin_popcount(x)
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define dbg(x) cout << (#x) << " = " << x << " "
#define fini cout << "\n";
#define line cout << "-----------------------------------\n";
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef tree<
ll,
null_type,
less_equal<ll>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
 
int read (){
    int x = 0, f = 1; char s = getchar();while (s < '0' || s > '9') {if (s == '-') f = -1; s = getchar();}
    while (s >= '0' && s <= '9') x = x * 10 + s - '0', s = getchar();
    return x * f; 
}
const ll M=2e5+7;
const ll N=2e7+7;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;


void go(int ide){
	ll n; cin >> n;

	if (n%2) cout << "Odd\n";
	else if (n%4) cout << "Same\n";
	else cout << "Even\n";
}

int main(){
    fastio;
    int tst=1;
    cin >> tst;
    // cout << fixed << setprecision(12);
    fp(i,0,tst) go(i+1);
 
    return 0;
}