Bittijono

sA = [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0]


count = int(input())

n = 0
kList = []
bArr = sA

while(n < count):
    kList.append(int(input()))
    n += 1

for k in kList:
    tempMod = k % 16
    if(sA[tempMod] == 0):
        tempArr = sA
    else:
        tempArr = reversed(sA)

    while(bArr.__len__() < (k - tempMod) / 16):
        bArr += reversed(bArr)


    print(bArr[int((k - tempMod) / 16)])

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR