#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VL a(n);
  rep(i, n) cin >> a[i];
  int negs = count_if(all(a), [](ll x) { return x < 0; });
  if (negs % 2) {
    cout << 1 << '\n';
    return 0;
  }
  a.erase(remove_if(all(a), [](ll x) { return x < 0; }), a.end());
  n = a.size();
  int g[60]{};
  rep(x, 60) {
    set<int> st;
    rep(i, 10) if (x >> i & 1) st.emplace(g[i]);
    while (st.contains(g[x])) g[x]++;
  }
  int x = 0;
  for (ll ai : a) {
    set<int> st;
    rep(i, 60) if (ai >> i & 1) st.emplace(g[i]);
    int xi = 0;
    while (st.contains(xi)) xi++;
    x ^= xi;
  }
  cout << (x ? 1 : 2) << '\n';
}