import java.lang.Integer
import java.lang.Long

fun main(args: Array<String>) {
    val N = readInputLine().toInt()

    // i>=2 の場合、a_i,jは[0,2]となり、この計算は差を見るため全体を1引いても問題なし
    val a = readInputLine().map { it - '1' }.toIntArray()

    val isOdd = a.foldIndexed(false) {
        index, acc, a ->
        if (a % 2 == 0) {
            acc
        } else {
            if (lucas(N - 1, index, 2) == 1) {
                !acc
            } else {
                acc
            }
        }
    }

    if (isOdd) {
        println(1)
    } else {
        if (a.contains(1)) {
            println(0)
        } else {
            val isTwo = a.foldIndexed(false) {
                index, acc, a ->
                if (a == 0) {
                    acc
                } else {
                    if (lucas(N - 1, index, 2) == 1) {
                        !acc
                    } else {
                        acc
                    }
                }
            }
            if (isTwo) {
                println(2)
            } else {
                println(0)
            }
        }
    }
}

fun readInputLine(): String {
    return readLine()!!
}

// nCm mod p (p is prime number)
fun lucas(n: Int, m: Int, p: Int): Int {
    if (m > n) {
        return 0
    }

    var ret = 1L

    val nDec = Integer.toString(n, p)
    val mDec = Integer.toString(m, p).padStart(nDec.length, '0')

    for (i in 0 until nDec.length) {
        val nNum = Long.parseLong(nDec[i].toString(), p)
        val mNum = Long.parseLong(mDec[i].toString(), p)

        if (mNum > nNum) {
            return 0
        }

        for (j in LongRange(1L, nNum)) {
            ret *= j
        }
        for (j in LongRange(1L, mNum)) {
            ret /= j
        }
        for (j in LongRange(1L, mNum - nNum)) {
            ret /= j
        }
    }

    return ret.toInt()
}
