# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(int i=((int)(n)); i>0; --i)
# define repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)
# define reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)
# define all(x) std::begin(x), std::end(x)
# define rall(x) std::rbegin(x), std::rend(x)
# define pb push_back
# define eb emplace_back
# define len(x) ((int)(x).size())
using namespace std;
template<class T> using vec = vector<T>;
using pii = pair<int, int>;
using vi = vec<int>;
using vvi = vec<vi>;
using db = deque<bool>;
using ddb = deque<db>;
using vs = vec<string>;
constexpr int INF = (1LL<<62)-(1LL<<31);
constexpr float EPS = 1e-10;
template<class T> istream& operator>>(istream& is, vec<T>& v) { for (auto& x : v) is >> x; return is; }
template<class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.fi >> p.se; }
template<class T> string join(const vec<T> &v){ stringstream s; rep (i, len(v)) s<<' '<<v[i]; return s.str().substr(1); }
template<class T> ostream& operator<<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }
template<class T> ostream& operator<<(ostream& os, const vec<vec<T>>& v){ rep (i, len(v)) if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? "\n" : ""); return os; }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << p.fi << " " << p.se; }
template<class T, class U, class V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); }
void print(){ cout << "\n"; }
template<class T, class... A>void print(const T& v, const A&...args){ cout << v; if(sizeof...(args))cout << " "; print(args...); }
void eprint() { cerr << "\n"; }
template<class T, class... A>void eprint(const T& v, const A&...args){ cerr << v; if(sizeof...(args))cerr << " "; eprint(args...); }
void drop(){ cout << "\n"; exit(0); }
template<class T, class... A>void drop(const T& v, const A&...args){ cout << v; if(sizeof...(args))cout << " "; drop(args...); }
template<class T> constexpr bool chmax(T &a, const T& b) { return a < b && (a = b, true); }
template<class T> constexpr bool chmin(T &a, const T& b) { return a > b && (a = b, true); }
constexpr int ctoi(const char c) { return ('0' <= c and c <= '9') ? (c - '0') : -1; }
struct Setup_io { Setup_io() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0), cerr.tie(0); cout << fixed << setprecision(15); } } setup_io;
# endif  // ngng628_library

vi divisor(int n) {
   vi v;
   for (int i = 1; i*i <= n; i++) {
       if (n % i == 0) {
           v.pb(i);
           if (i*i != n) v.pb(n / i);
       }
   }
   sort(all(v));
   return v;
}

struct Solver {
   void solve() {
      int n;
      cin >> n;

      if (n % 2 == 0 and (n / 2) & 1) {
         print("Same");
      }
      else if (n % 2 == 0) {
         print("Even");
      }
      else {
         print("Odd");
      }
   }
};

int32_t main() {
   int t;
   cin >> t;
   while (t--) {
      Solver solver;
      solver.solve();
   }
}

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;

int main()
{
  int n, cnt = 0;
  cin >> n;
  string t;
  cin >> t;

  if (n == 1)
  {
    if (t == "0")
    {
      cout << 10000000000 << endl;
    }
    else
    {
      cout << 2 * 10000000000 << endl;
    }
  }
  else if (n == 2)
  {
    if ((t == "11") || (t == "10"))
    {
      cout << 10000000000 << endl;
    }
    else if (t == "01")
    {
      cout << 10000000000 - 1 << endl;
    }
    else
    {
      cout << 0 << endl;
    }
  }
  else
  {
    REP(i, t.length() - 2)
    {
      if ((t[i] == '0' && t[i + 1] == '1' && t[i + 2] == '0') || (t[i] == '1' && t[i + 1] == '1' && t[i + 2] == '1') || (t[i] == '0' && t[i + 1] == '0' && t[i + 2] == '1') || (t[i] == '1' && t[i + 1] == '0' && t[i + 2] == '0') || (t[i] == '0' && t[i + 1] == '0' && t[i + 2] == '0'))
      {
        cout << 0 << endl;
        return 0;
      }
    }
    REP(i, t.length())
    {
      if (t[i] == '0')
      {
        cnt++;
      }
    }
    if (t[t.length() - 1] == '0')
    {
      cout << 10000000000 - cnt + 1 << endl;
    }
    else
    {
      cout << 10000000000 - cnt << endl;
    }
  }
}