#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<ctime>
using std::max;
using std::min;
using std::sort;
using std::swap;
typedef long long LL;
int T;
LL N;
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
	#endif
	scanf("%d",&T);
	while(T--)
	{
		scanf("%lld",&N);
		if(N&1) puts("Odd");
		else
		{
			if(N%4==0) puts("Even");
			else puts("Same");
		}
	}
	return 0;
}
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;

//MINT
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
    mint operator+(const mint a) const { return mint(*this) += a;}
    mint operator-(const mint a) const { return mint(*this) -= a;}
    mint operator*(const mint a) const { return mint(*this) *= a;}
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime mod
    mint inv() const { return pow(mod-2);}
    mint& operator/=(const mint a) { return *this *= a.inv();}
    mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

// POWER_MODver. N^k % MOD
ll mod_pow(ll n, ll k){
    ll res = 1;
    for(; k > 0; k >>= 1){
        if(k&1) res = (res*n)%mod;
        n = (n*n)%mod;
    }
    return res;
}

int main()
{
    int n;
    cin >> n;
    vector<mint> a(n);
    rep(i, 0, n) cin >> a[i];
    vector<vector<mint>> dp(n, vector<mint> (2));
    vector<vector<mint>> dpp(n+1, vector<mint> (2));
    dpp[0][0] = 1;
    rep(i, 1, n){
        dpp[i][0] += dpp[i-1][0] + dpp[i-1][1];
        dpp[i][1] += dpp[i-1][0];
    }
    dp[0][0] = a[0];
    rep(i, 1, n){
        dp[i][0] += dp[i-1][0] + a[i]*mint(dpp[i-1][0]) + dp[i-1][1] + a[i]*mint(dpp[i-1][1]);
        dp[i][1] += dp[i-1][0] - a[i]*mint(dpp[i-1][0]);
    }
    cout << dp[n-1][0] + dp[n-1][1] << endl;
    return 0;
}


