#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<ll> vl;

// input
int N;
vi A;


void input() {
    cin >> N;
    A = vi(N);
    rep(i, N) cin >> A[i];
}


int main() {
    input();
    ll ans = 0;
    ll x = 0;
    ll s = 0;
    ll mx = 0;
    rep(i, N) {
        s += A[i];
        mx = max(mx, s);
        ans = max(ans, x + mx);
        x += s;
    }
    cout << ans << endl;
}

//{{{
#include<algorithm>
#include<cmath>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<sys/time.h>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include"rprint2.hpp"
#else
#define FUNC(name) template <ostream& out = cout, class... T> void name(T&&...){ }
FUNC(printde) FUNC(printdbe) FUNC(printdwe) FUNC(printdu) FUNC(printe) FUNC(printe0);
#endif
template <template <class T, class = std::allocator<T>> class V, class E>
istream& operator >> (istream& in, V<E>& v){ for(auto& e : v){ in >> e; } return in; }
struct Init { Init(){
    cin.tie(0); ios::sync_with_stdio(false);
} } init;
//}}}

int main(){
    // for(int i = 1; i < 1000; i++){
    //     int e = 0, o = 0;
    //     for(int j = 1; j <= i; j++){
    //         if(i % j == 0){
    //             (j & 1 ? o : e)++;
    //         }
    //     }
    //     printe(i, e, o, e < o ? "Odd" : e == o ? "Same" : "Even");
    // }
    int t; cin >> t;
    vector<string> strs({"Even", "Odd", "Same", "Odd"});
    for(int _ = 0; _ < t; _++){
        ll n; cin >> n;
        cout << strs[n & 3] << '\n';
    }
}
