#pragma comment(linker, "/STACK:1024000000,1024000000")

#include <cstdio>

#include <string>

#include <cstdlib>

#include <cmath>

#include <iostream>

#include <cstring>

#include <set>

#include <queue>

#include <algorithm>

#include <vector>

#include <map>

#include <cctype>

using namespace std ;

typedef long long LL;

typedef pair<int, int> P;

const int INF = 0x3f3f3f3f;

const double inf = 0x3f3f3f3f3f3f3f;

const double eps = 1e-8;

const int maxn = 1e4 + 5;

const int mod = 1e9 + 7;

const int dr[] = {0, 0, -1, 1};

const int dc[] = {-1, 1, 0, 0};

int n, m;

inline bool is_in(int r, int c){

    return r >= 0 && r < n && c >= 0 && c < m;

}

int main(){

    cin >> n;

    LL sum = 0;

    for(int i = 0; i < n; ++i){

        scanf("%d", &m);

        sum += (LL)(m-1);

        if(sum & 1)  printf("1\n");

        else printf("2\n");

    }

    return 0;

}