Problem:


Score : 100 points

Problem Statement

We have five variables x_1, x_2, x_3, x_4, and x_5.

The variable x_i was initially assigned a value of i.

Snuke chose one of these variables and assigned it 0.

You are given the values of the five variables after this assignment.

Find out which variable Snuke assigned 0.

Constraints

The values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.

Input

Input is given from Standard Input in the following format:

x_1 x_2 x_3 x_4 x_5

Output

If the variable Snuke assigned 0 was x_i, print the integer i.

Sample Input 1

0 2 3 4 5

Sample Output 1

1

In this case, Snuke assigned 0 to x_1, so we should print 1.

Sample Input 2

1 2 0 4 5

Sample Output 2

3



Sample input:
0 2 3 4 5


Sample output:
1

Submission status: Accepted

Solution code:
x_1,x_2,x_3,x_4,x_5=map(int,input().split())
if x_1==0:
    print("1")
if x_2==0:
    print("2")
if x_3==0:
    print("3")
if x_4==0:
    print("4")
if x_5==0:
    print("5")

Submission status: Accepted

Solution code:
apple = list(map(int, input().split()))
for i, j in zip(apple, range(1, 6)):
    if i == 0:
        print(j)
        break
    else:
        pass

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
for i in range(5):
    if A[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
ans = 0
for i in range(5):
  if x[i] == 0:
    ans = i+1
    break
print(ans)

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))

print(n.index(0)+1)

Submission status: Accepted

Solution code:
a,b,c,d,e = map(int,input().split())

if a == 0:
  print(1)
elif b == 0:
  print(2)
elif c == 0:
  print(3)
elif d == 0:
  print(4)
elif e == 0:
  print(5)

Submission status: Accepted

Solution code:
def main():
    a = list(map(int,input().split()))
    for i in range(len(a)):
        if a[i] == 0:
            print(i+1)
if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(len(x)):
    if x[i] == 0:
        ans = i

print(ans+1)

Submission status: Accepted

Solution code:
import itertools
import copy
from collections import deque
import heapq
s = list(map(int,input().split()))
for ans,i in enumerate(s):
    if i == 0:
        print(ans+1)
        exit()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    x = [int(i) for i in input().strip().split()]

    return x.index(0)+1


if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(5):
    if x[i] == 0:
        print(i + 1)
        exit()

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
answer = 1
for v in x:
    if v == 0:
        break
    else:
        answer += 1

print(answer)

Submission status: Accepted

Solution code:
L = list(map(int, input().split()))
for l in range(len(L)):
    if L[l]==0:
        ans = l+1
print(ans)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))

for i in range(5):
    if X[i] == 0:
        ans = i + 1
        print(ans)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))


ans = 0

for i in range(len(x)):
    if x[i]==0:
        ans = i+1

print(ans)

Submission status: Accepted

Solution code:
a= list(map(int,input().split()))
ans=0
for i in range(5):
    if a[i]==0:
        ans=i+1

print(ans)

Submission status: Accepted

Solution code:
X = [int(i) for i in input().split()] 

for i, x in enumerate(X):
  if x == 0:
    print(i+1)
    exit()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a,b,c,d,e=map(int,input().split())

if a==0:
    print(1)
if b==0:
    print(2)
if c==0:
    print(3)
if d==0:
    print(4)
if e==0:
    print(5)

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

for i in range(5):
  if l[i] == 0:
    print(i+1)

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
for i in range(len(A)):
    if A[i] == 0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

out = []
for i in range(len(x)):
  if x[i] == 0:
    out.append(i+1)
print(*out)

Submission status: Accepted

Solution code:
a,s,d,f,g = map(int, input().split())

for num, i in enumerate([a,s,d,f,g]):
    if i == 0:
        print(num+1)

Submission status: Accepted

Solution code:
lst=list(map(int,input().split()))
print(15-sum(lst))

Submission status: Accepted

Solution code:
# coding: utf-8

import math
import re
import numpy as np
import copy

S = input().split(" ")

for i in range(len(S)):
    if S[i] == "0":
        print(i+1)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

A = LI()

for i in range(5):
    if A[i] != i+1:
        print(i+1)
        break

Submission status: Accepted

Solution code:
li = input().split()
print(li.index("0")+1)

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
for k in range(5):
    if A[k] == 0:
        print(k+1)
        break

Submission status: Accepted

Solution code:
x = [int(i) for i in input().split()]
print(x.index(0) +1)

Submission status: Accepted

Solution code:
c=list(map(int, input().split())) 

for i in range(5):
    if c[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
x=list(map(int,input().strip().split()))

print(x.index(0)+1)

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc170/abc170_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    x = i2nn()
    for i in range(5):
        if x[i] == 0:
            print(i + 1)
            return
    return

main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s = list(map(int,input().split()))
for i,j in enumerate(s):
    if j == 0:
        print(i + 1)

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

a, b, c, d, e = map(int, input().split())

if a==0:
    print(1)
elif b==0:
    print(2)
elif c==0:
    print(3)
elif d==0:
    print(4)
else:
    print(5)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
for i, x in enumerate(X):
    if x == 0:
        print(i+1)

Submission status: Accepted

Solution code:
line = list(map(int,input().split()))
print(line.index(0)+1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def slove():
    A = list(map(int,input().split()))
    for i in range(5):
        if A[i] == 0:
            print(i+1)


if __name__ == "__main__":
    slove()

Submission status: Accepted

Solution code:
X=list(map(int, input().split()))


for i in range(5):
    if X[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

c = 0
for i in x:
    c += 1
    if i == 0:
        print(c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    x1, x2, x3, x4, x5 = input_to_int_map()

    for i, val in enumerate([x1, x2, x3, x4, x5]):
        if val == 0:
            return i + 1


if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    x1, x2, x3, x4, x5 = map(int, readline().split())
    if x1 == 0:
        print('1')
    elif x2 == 0:
        print('2')
    elif x3 == 0:
        print('3')
    elif x4 ==0:
        print('4')
    else:
        print('5')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

x = list(map(int, input().split()))

for i in range(5):
    if x[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))

for i in range(len(a)):
    if a[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
for i in range(5):
    if A[i]==0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
a,b,c,d,e=map(int,input().split())
if(a==0):print(1)
elif(b==0):print(2)
elif(c==0):print(3)
elif(d==0):print(4)
else: print(5)

Submission status: Accepted

Solution code:
num_list = list(map(int,input().split()))

print(num_list.index(0)+1)

Submission status: Accepted

Solution code:

x = list(map(int,input().split()))

for i in range(5):
    if x[i]==0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

x = map(int, input().split())
x = list(x)

for i, xx in enumerate(x):
    if (i+1)!=xx:
        print(i+1)
        break

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
for i in range(len(x)):
    if x[i] == 0:
        answer = i+1
print(answer)

Submission status: Accepted

Solution code:
import sys

X = list(map(int, sys.stdin.readline().rsplit()))
for i, x in enumerate(X):
    if x == 0:
        print(i + 1)
        exit()

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



if __name__ == '__main__':
    datas = list(map(int, input().split()))

    # 出力
    for i, d in enumerate(datas):
        if d == 0:
            print(i+1)
            exit()

Submission status: Accepted

Solution code:
A = list(map(int , input().split()))
for i in range(len(A)):
    if A[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    x = list(map(int, input().split()))
    print(x.index(0) + 1)

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))

i = A.index(0)
print(i+1)

Submission status: Accepted

Solution code:
from collections import Counter
import sys

sys.setrecursionlimit(10 ** 6)

mod = 1000000007
inf = int(1e18)

dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


def main():
    a = list(map(int, input().split()))
    for i in range(5):
        if a[i] == 0:
            print(i+1)
            return
main()

Submission status: Accepted

Solution code:
xi = list(map(int,input().split()))
for i in range(len(xi)):
  if xi[i] == 0:
    print(i+1)

Submission status: Accepted

Solution code:
x=list(map(int, input().split()))

for i in range(5):
	if x[i]==0:
		print(i+1)

Submission status: Accepted

Solution code:
import sys
x = list(map(int, input().split()))

for i in range(len(x)):
    if x[i] == 0:
        print(i+1)
        sys.exit(0)

Submission status: Accepted

Solution code:
X = [int(i) for i in input().split()]
ans = 15 - sum(X)
print(ans)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
i = X.index(0)
print(i + 1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
for i, el in enumerate(x):
    if el == 0:
        print(i+1)
        break
    else:
        continue

Submission status: Accepted

Solution code:
x = list(map(int,(input().split())))

i = 1

for j in x:
    if j == 0:
        print(i)
    else:
        i +=1

Submission status: Accepted

Solution code:
def main():
    #n = int(input())
    x = list(map( int, input().split()))
    #b,w = map( int, input().split())
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c, d, e = [int(_) for _ in input().split(' ')]
print(15 - (a + b + c + d + e))

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
n=0
for x in a:
    n+=1
    if x==0:
        ans=n
print(ans)

Submission status: Accepted

Solution code:
X = input().split()

for i in range(5):
    if (X[i] == "0"):
        print(i+1)

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))

import sys

for i in range(5):
    if x[i] == 0:
        print(i+1)
        sys.exit()

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]

for i in range(5):
    if list[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
x = list( map(int,input().split()) )

for i in range(5):
  if x[i] == 0:
    ans = i+1

print(ans)

Submission status: Accepted

Solution code:
c=list(map(int,input().split()))
for i in range(len(c)):
    if c[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
ans = 0
if x[0] == 0:
  ans = 1
elif x[1] == 0:
  ans = 2
elif x[2] == 0:
  ans = 3
elif x[3] == 0:
  ans = 4
elif x[4] == 0:
  ans = 5
print(ans)

Submission status: Accepted

Solution code:
numbers = list(map(int, input().split()))

ans = numbers.index(0) + 1

print(ans)

Submission status: Accepted

Solution code:
S = list(input().split())
print(S.index('0') + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    xs = [int(x) for x in input().split()]
    for i, x in enumerate(xs, start=1):
        if x == 0:
            print(i)
            break


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
def main():
    x = [int(i) for i in input().split()]
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
p=list(map(int,input().split()))
n=sum(p)
print(15-n)

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))

for i, x in enumerate(X):
    if x == 0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
for i in range(5):
    x = X[i]
    if x == 0:
        print(i+1)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()));

for i in range(5):
    if a[i] == 0:
        print(i+1);

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    x = list(map(int, input().split()))
    print(x.index(0)+1)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
for i in range(5):
  if a[i]!=i+1:
    break
print(i+1)

Submission status: Accepted

Solution code:
L = list(map(int,input().split()))


for i in range(len(L)):
    if L[i] == 0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
vals = map(int, input().split(" "))
for i, v in enumerate(vals, start=1):
  if v == 0:
    print(i)
    break

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
if A[0] == 0:
    print(1)
if A[1] == 0:
    print(2)
if A[2] == 0:
    print(3)
if A[3] == 0:
    print(4)
if A[4] == 0:
    print(5)

Submission status: Accepted

Solution code:
a,b,c,d,e = map(int, input().split())
if a == 0:
    print(1)
elif b == 0:
    print(2)
elif c == 0:
    print(3)
elif d == 0:
    print(4)
else:
    print(5)

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest


def resolve():
    # s = input()
    # n = int(input())
    # a, b = map(int, input().split())
    l = list(map(int, input().split()))

    for i in range(len(l)):
        if l[i] == 0:
            print(i + 1)


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """0 2 3 4 5"""
        output = """1"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 2 0 4 5"""
        output = """3"""
        self.assertIO(input, output)


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
for i in range(len(a)):
    if a[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))

for i in range(5):
    if A[i]==0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
i = X.index(0)
print(i+1)

Submission status: Accepted

Solution code:
n = list(map(int, input().split(" ")))

print(n.index(0)+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i,value in enumerate(x):
    if value == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
for i in range(1, len(x)+1):
    if x[i-1] == 0:
        print(i)

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = IL()
for i in range(5):
  if a[i] == 0:
    print(i+1)
    exit()

Submission status: Accepted

Solution code:
line = input().split()

for num in line:
  if num == "0":
    print(line.index(num) + 1)

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
for i in range(5):
	if X[i] != i+1:
		print(i+1)

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
for num,i in enumerate(l):
    if i == 0:
        print(num+1)

Submission status: Accepted

Solution code:
x1,x2,x3,x4,x5=map(int,input().split())

if x1==0:
    print(1)
if x2==0:
    print(2)
if x3==0:
    print(3)
if x4==0:
    print(4)
if x5==0:
    print(5)

Submission status: Accepted

Solution code:
ans = 0 
for i in range(1,6):
    ans ^= i

for a in map(int,input().split(" ")):
    ans ^= a

print(ans)

Submission status: Accepted

Solution code:
A = [int(v) for v in input().strip().split(" ")]
for i in range(len(A)):
    if A[i] == 0:
        print(i + 1)

Submission status: Accepted

Solution code:
la = list(map(int, input().split()))
print(la.index(0)+1)

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

A = getList()
for i in range(len(A)):
    if A[i] == 0:
        print(i + 1)
        break

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))

print(s.index(0)+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(5):
    if x[i] == 0:
        print(i + 1)
        exit()

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))

for i in range(len(x)):
	if x[i] == 0:
		print(i+1)
		exit()

Submission status: Accepted

Solution code:
x1,x2,x3,x4,x5 = map(int, input().split())
if x1==0:
    print(1)
if x2==0:
    print(2)
if x3==0:
    print(3)
if x4==0:
    print(4)
if x5==0:
    print(5)

Submission status: Accepted

Solution code:
#N = int(input())
#N = int(input())
#S = input()
# = input().split()
# = input().split()
# = map(int,input().split())
# = map(int,input().split())
X = list(map(int,input().split()))
# = list(map(int,input()).split())

for i in range(len(X)):
    if X[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
for i in range(5):
    if X[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
nums =[int(e) for e in input().split()]

for i in range(len(nums)):
    if nums[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
x1, x2, x3, x4, x5 = map(int, input().split())
if x1==0:
    print("1")
elif x2 ==0:
    print("2")
elif x3 ==0:
    print("3")
elif x4 ==0:
    print("4")
elif x5 ==0:
    print("5")

Submission status: Accepted

Solution code:
l = list(map(int,input().split(' ')))
for n,i in enumerate(l):
    if not i:
        print(n+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i, n in enumerate(x):
    if n == 0:
        print(i+1)

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))
for i in range(5):
    if n[i]==0:
        print(i+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(0, len(x)):
    if x[i] == 0:
        ans = i + 1

print(str(ans))

Submission status: Accepted

Solution code:
x =  list(map(int, input().split()))
for i,y in enumerate(x):
    if y ==0:
        print(i+1)

Submission status: Accepted

Solution code:
l = [int(j) for j in input().split()]
print(l.index(0)+1)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))

for i in range(len(x)):
        if x[i] == 0:
                print(i+1)
                exit()

Submission status: Accepted

Solution code:
input_line = list(map(int,input().split(' ')))

print(15-sum(input_line))

Submission status: Accepted

Solution code:
def solve():
    x = list(map(int, input().split()))

    for i in range(len(x)):
        if x[i]==0:
            return i+1



print(solve())

Submission status: Accepted

Solution code:
x=list(map(int, input().split()))
for i in range(1,6):
    if x[i-1]!=i:
        print(i)

Submission status: Accepted

Solution code:
num=list(map(int,input().split()))
ans=0
for i in range(5):
    if(num[i]==0):
        ans=i+1
        break
print(ans)

Submission status: Accepted

Solution code:
import itertools
import decimal
import math
import collections
import sys
input = sys.stdin.readline

A,B,C,D,E=map(int,input().split())

#ListA=list(map(int,input().split()))

ans=0
if(A==0):
    ans=1
if(B==0):
    ans=2
if(C==0):
    ans=3
if(D==0):
    ans=4
if(E==0):
    ans=5
print(ans)

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
print(a.index(0)+1)

Submission status: Accepted

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
#N = int(input())
#S,T = map(int, input().split())
A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]

#cnt = 0
#cnt += 1

for i in range(5):
    if A[i] ==0:
        print(i+1)
        break


#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')
#print(cnt)

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
ans=0
for n in range(5):
    if A[n]==0:
        ans=n+1
print(ans)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
for i in range(len(a)):
    if a[i] == 0:
        print(i+1)

Submission status: Accepted

Solution code:
import numpy as np

x = list(map(int, input().split()))
#map(int, input().split())
#int(input())

xarrray = np.array(x)
ans = 15-xarrray.sum()

print(int(ans))

Submission status: Accepted

Solution code:
x=input()
x0=x.split()
a1=int(x0[0])
a2=int(x0[1])
a3=int(x0[2])
a4=int(x0[3])
a5=int(x0[4])
if a1==0:
    print(1)
if a2==0:
    print(2)
if a3==0:
    print(3)
if a4==0:
    print(4)
if a5==0:
    print(5)

Submission status: Accepted

Solution code:
a = list(map(int , input().split()))
for i in range(5):
    if a[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
import numpy as np
import sys
import math
import itertools
import collections

a = map(int,input().split())

for i , a in enumerate(a):
    if a == 0:
        print(i+1)
        sys.exit()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

for i in range(5):
    if a[i] == 0:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
li=list(map(int,input().split()))
cnt=0
for i in li:
  cnt+=1
  if i == 0:
    print(cnt)

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
for i in range(len(x)):
    if x[i] == 0:
        ans = i + 1
        break
    else:
        pass

print(ans)