#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;
}



#define _CRT_SECURE_NO_WARNINGS
#define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (ll i = k; i < n; i++)
#define ford(i, k, n) for (ll i = k; i >= n; i--)
#define pb push_back
#define ff first
#define ss second

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <list>
#include <queue>
#include <bitset>
#include <map>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;



int main() {
	fast;
	int t;
	cin >> t;
	while (t--) {
		ll n;
		cin >> n;
		int cnt = 0;
		while (n % 2 == 0) {
			n /= 2;
			cnt++;
		}
		if (cnt == 0)cout << "Odd\n";
		else if (cnt == 1)cout << "Same\n";
		else cout << "Even\n";
	}
	return 0;
}