#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { constexpr int B = 60; int n; cin >> n; array dp{}; FOR(i, 1, B + 1) { set s; for (int j = 0; (1 << j) <= i; ++j) { if (i >> j & 1) { assert(j < i); s.emplace(dp[j]); } } while (s.contains(dp[i])) ++dp[i]; } int x = 0; while (n--) { ll a; cin >> a; if (a < 0) { x ^= 4; } else { set s; for (int j = 0; (1LL << j) <= a; ++j) { if (a >> j & 1) { assert(j < a); s.emplace(dp[j]); } } int y = 0; while (s.contains(y)) ++y; x ^= y; } } cout << (x == 0 ? "2\n" : "1\n"); return 0; }