#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

int main(){
    int T;scanf("%d",&T);
    while(T--){
        LL n;scanf("%lld",&n);
        int e = 0;while(!(n&1)) ++e,n >>= 1;
        if(e == 0){
            puts("Odd");
        }
        else if(e == 1){
            puts("Same");
        }
        else puts("Even");
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define pii pair<long long, long long>
#define FOR(x, j) for(int x = 0; x < j; x++)
using ll = long long;

const int LEAF = 18;
int tree[2*LEAF];


const int maxN = 2e5+10;
//const ll INF = 1000LL*1000LL*1000LL*1000LL*1000LL*10LL;
const int INF = 2e9;

ll DP[maxN];
ll A[maxN], B[maxN];

void solve(){
    int n; cin >> n;
    FOR(i, n)
        cin >> A[i];
    FOR(i, n)
        cin >> B[i];
    DP[0] = A[0]*B[0];
    ll maxA = A[0];
    for(int i = 1; i < n; i++){
        maxA = max(maxA, A[i]);
        DP[i] = max(DP[i-1], maxA*B[i]);
    }
    FOR(i, n)
        cout << DP[i] << "\n";
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = false;
    //multitest = true;
    if (multitest) {
        int t; cin >> t;
        while (t--)
            solve();
    }
    else
        solve();
}
