#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
    int T; cin >> T;
    while(T--){
        ll N; cin >> N;
        if(N & 1){
            cout << "Odd\n";
        } else{
            if((N / 2) & 1) cout << "Same\n";
            else cout << "Even\n";
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

#include <stdio.h>
#include <algorithm>
#include <tuple>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int bits[400001];
void add(int index, int value) {
	for (int i = index; i <= 400000; i += i & -i)
		bits[i] += value;
}
int sum(int index) {
	int res = 0;
	for (int i = index; 0 < i; i -= i & -i)
		res += bits[i];
	return res;
}

int n, a[310000];
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", a + i), a[i]++;

	ll t = 0;
	for (int i = 1; i <= n; i++) {
		t += sum(n) - sum(a[i]);
		add(a[i], 1);
	}

	for (int i = 1; i <= n; i++) {
		printf("%lld\n", t);
		t += (n - a[i]);
		t -= (a[i] - 1);
	}
}