// ============================================================================
// ||                                                                        ||
// ||             International University of Business,Agriculture           ||
// ||                           And Technology                               ||
// ||                           Redwan Ahmed Khan                                ||
// ||                  Bismillah-ir-Rahman-ir-Rahim                          ||
// ||                                                                        ||
// ============================================================================
#include<bits/stdc++.h>

#define int                           long long
#define ld                            long double
#define ull                           unsigned long long int
#define chr                           char
#define st                            string

#define pb                            push_back
#define pp                            pop_back
#define mp                            make_pair
#define vin                           vector<int>
#define vch                           vector<char>
#define vst                           vector<string>
#define pii                           pair<int,int>
#define triplet                       pair<ll,pair<ll,ll>>
#define mpin                          map<int,int>
#define mod                           1000000007
#define pi                            2 * acos (0.0)
#define mx1                           320000




#define print(x)                      printf("%lld\n",x)
#define input(x)                      scanf("%lld",&x)
#define stringin                      scanf(" %[^\n]%*c", a)
#define sz(x)                         (x).size()
#define read(x)                       int x; cin >> x;
#define loj(case_no,result)           cout<<"Case "<<case_no<<": "<<result<<endl
#define loj2(case_no,result)          cout<<"Case "<<case_no<<":"<<endl<<result<<endl
#define fr(a,b)                       for(int i = a; i < b; i++)
#define frc(a,b)                       for(int i = a; i > b; i--)
#define rep(i,a,b)                    for(int i = a; i < b; i++)
#define testcase(t)                   int t ; cin>>t ; while(t--)
#define all(x)                        (x).begin(), (x).end()
#define setbits(x)                    __builtin_popcountll(x)
#define zrobits(x)                    __builtin_ctzll(x)
#define prDouble(x)                   cout << fixed << setprecision(10) << x<<endl
#define lcm(a,b)                      (a*b)/__gcd(a,b);
#define erase(a,b)                     a.erase(a.begin()+(b-1))
#define mem(a, b)                      memset(a, b, sizeof(a))
#define trv(x)                         ((x).begin(),(x).end())


#define db(x)                         cout<<#x <<"=" <<x<<endl
#define time                          cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
#define fast_io                       ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;

void solve()
{	testcase(t)
	{
		read(n);
		int  c = 0;
		while (n && n % 2 == 0)
		{
			c++;
			n /= 2;
		}
		if (c == 1)cout << "Same" << endl;
		else if (c == 0)cout << "Odd" << endl; \
		else cout << "Even" << endl;
	}
}
void init_code() {
	fast_io;

#ifndef ONLINE_JUDGE()
	(void)!freopen("input.txt", "r", stdin);
	(void)!freopen("output.txt", "w", stdout);

#endif
}

int32_t main()
{
	init_code();
	solve();
	time;
	return 0;
}

// Alhamdulillah. I have solved this problem by the grace of the Almighty Allah
#include    <bits/stdc++.h>
using       namespace std;
#define     endl "\n"
#define     pb push_back
#define     ll long long
#define     int ll
#define     mod 1000000007
#define     DEBUG cout<<"Hello1\n";
#define     all(v) (v).begin(),(v).end()
#define     deb(...) debug(#__VA_ARGS__, __VA_ARGS__);
const int   N = 1e6 + 5;
const ll    inf = 1e18 + 5;
typedef     pair<int, int> pii;
void        fileIO();

template<class T> void print_container(T &container);
template<class T> void print_pair_container(T &container);
template<class T> void printArr(T &a, int n);
template<typename T> void debug(string s, T x);
template<typename T, typename... Args>
void debug(string s, T x, Args... args);

int n, m;

void solve(int tc = 0) {
	cin >> n;

	if (n % 2) {
		cout << "Odd\n";
	} else {
		if ((n / 2) % 2 == 0) {
			cout << "Even\n";
		} else {
			cout << "Same\n";
		}
	}
}

int32_t main()
{
	fileIO();

	int t = 1; cin >> t; for (int i = 1; i <= t; i++)
		solve();

	return 0;
}






void fileIO() {

	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
}


template<typename T> void debug(string s, T x)
{
	cout << s << " = " << x << "\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args)
{
	cout << s.substr(0, s.find(',')) << " = " << x << " | ";
	debug(s.substr(s.find(',') + 2), args...);
}

template<class T> void print_container(T &container)
{
	for (auto &t : container)
	{
		cout << t << " ";
	}
	cout << endl;
}
template<class T> void print_pair_container(T &container)
{
	for (auto &t : container)
	{
		cout << t.first << " " << t.second << endl;
	}
	cout << endl;
}
template<class T> void printArr(T &a, int n)
{
	for (int i = 0; i < n; i++)
	{
		cout << a[i] << " ";
	}
	cout << endl;
}


