#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
long long int power(long long int x, long long int y) {
  long long int t = 1;
  while (y > 0) {
    if (y % 2)
      y -= 1, t = t * x % mod;
    else
      y /= 2, x = x * x % mod;
  }
  return t;
}
long long int inverse(long long int q) {
  long long int t;
  t = power(q, mod - 2);
  return t;
}
long long int gcd(long long int a, long long int b) {
  long long int c;
  if (b == 0)
    return a;
  else
    while (b != 0) {
      c = b;
      b = a % b;
      a = c;
    }
  return a;
}
int main() {
  long long int n, i, j, k, l, last;
  cin >> n;
  long long int a[n];
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (a[0] % 2 == 0) {
    cout << 1 << endl;
    last = 1;
  } else {
    cout << 2 << endl;
    last = 2;
  }
  for (i = 1; i < n; i++) {
    if (last == 1) {
      if (a[i] % 2 == 0) {
        cout << 2 << endl;
        last = 2;
      } else {
        cout << 1 << endl;
        last = 1;
      }
    } else {
      if (a[i] % 2 == 0) {
        cout << 1 << endl;
        last = 1;
      } else {
        cout << 2 << endl;
        last = 2;
      }
    }
  }
  return 0;
}
