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:
lst = list(map(int, input().split()))

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

Submission status: Accepted

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

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:
x = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''

    in_list = [int(item) for item in input().split()]

    for i, item in enumerate(in_list):
        if item == 0:
            print(i+1)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def intlist(x):
    y = []
    for i in range(len(x)):
        y.append(int(x[i]))
    return y

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

Submission status: Accepted

Solution code:
s = list(input().split())

print(s.index('0')  + 1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x_list = [int(_c) for _c in input().split(" ")]

idx = -1

for i in range(len(x_list)):
    if x_list[i] != i + 1:
        idx = i + 1

print(idx)

Submission status: Accepted

Solution code:

def main():
	l = map(int, input().split())
	for i, n in enumerate(l):
		if n == 0:
			print(i+1)
	return

if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for item in l:
  if(item == 0):
    print(l.index(item) + 1)

Submission status: Accepted

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

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

Submission status: Accepted

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


print(num_list.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)
else:
    print(5)

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:
import sys
from collections import deque
from itertools import *

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

x = LS()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
it = lambda: list(map(int, input().strip().split()))
INF = float('inf')

def solve():
    x1, x2, x3, x4, x5 = it()
    if x1 == 0:
        return 1
    if x2 == 0:
        return 2
    if x3 == 0:
        return 3
    if x4 == 0:
        return 4
    return 5

if __name__ == '__main__':
    print(solve())

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:
from sys import stdin
input = stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    l = [int(x) for x in input().split()]
    a=0
    for i in range(len(l)):
        if l[i]==0:
            a=i+1
    print(a)
main()

Submission status: Accepted

Solution code:
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:
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:
lst = list(map(int, input().split()))

print(lst.index(0)+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split(' ')
for i in range(5):
    if a[i] == '0':
        break
print(i+1)

Submission status: Accepted

Solution code:
# coding=UTF-8
from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
import numpy as np
import time
sys.setrecursionlimit(10**6)
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
lst=list(map(int,input().split()))
idx=lst.index(0)
print(idx+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)
    break

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import bisect
import numpy as np
import math
from collections import deque
from collections import defaultdict
from math import gcd


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:
x=list(map(int,input().split()))
s=x.index(0)
print(s+1)

Submission status: Accepted

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

print(a.index(0)+1)

Submission status: Accepted

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

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:
arr = [int(x) for x in input().split()]
for i, x in enumerate(arr):
    if x == 0:
        print(i+1)

Submission status: Accepted

Solution code:
#A - Five Variables
A= list(map(int,input().split()))

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

print(0)

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:
data = input().split()
print(data.index('0') + 1)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
# ab_sorted = sorted(ab, key=lambda x: x[0])
#ab = [list(map(int, input().split())) for i in range(n)]
# print(min(15*n, 100*(n//10+1), 100*(n//10)+15*(n % 10)))

for i in range(5):
    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:
        break
print(i+1)

Submission status: Accepted

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

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:
a = input().split(" ")
for i in range(5):
    if a[i] == "0":
        print(i+1)
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-06-14 21:00:14 +0900
# LastModified: 2020-06-14 21:01:59 +0900
#


import os
import sys
#import numpy as np
#import pandas as pd


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def intMap(): return map(int,input().split())
def intList(): return list(map(int, input().split())) #横並びの場合
#def intListVertical(N) [int(input()) for _ in range(N)] #縦並びの場合

a = intList()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
for e in a:
  if e==0:
    print(a.index(e)+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:
import numpy as np

x=np.array(input().split(" "),dtype=np.int32)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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

print(x.index(0)+1)

Submission status: Accepted

Solution code:
"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7

a,b,c,d,e = multi_int_input()

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:
X=list(map(int,input().split()))
for i in range(5):
  if X[i]!=i+1:
    print(i+1);exit()

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:
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)
elif e == 0:
  print(5)

Submission status: Accepted

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

for i in range(1,6):
  if(i != x[i-1]):
    break
print(i)

Submission status: Accepted

Solution code:
A = list(map(int, input().split())) 
for j,i in enumerate(A):
  if i == 0:
    print(j+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:
def A():
    x = list(map(int, input().split()))
    print(x.index(0)+1)
A()

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math


#t = int(input())
tmp = input().split()
a,b,c,d,e = list(map(lambda a: int(a), tmp))
if(a==0):
	print("1")
	sys.exit()
if(b==0):
	print("2")
	sys.exit()
if(c==0):
	print("3")
	sys.exit()
if(d==0):
	print("4")
	sys.exit()
if(e==0):
	print("5")
	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)
        break

Submission status: Accepted

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

ans=X.index(0)+1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

for i,a in enumerate(a_list):
    if a == 0:
        print(i+1)

Submission status: Accepted

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

for x in X:
        i +=1
        if x == 0:
                ans = i

print(ans)

Submission status: Accepted

Solution code:
x = [int(s) for s in input().split()]

ans = 100
for (i, x) in enumerate(x):
    if x == 0:
        ans = i + 1
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
for i, num in enumerate(l):
    if num == 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:
x = list(map(int,input().split()))
for i in range(5):
    if x[i] == 0:
        print(i+1)
        break

Submission status: Accepted

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    x=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    #ss=readline().rstrip()
    #yn(1)
    for i in range(len(x)):
        if x[i]==0:
            print(i+1)
            return

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def input():
    return sys.stdin.readline()


def resolve():
    a_list = list(map(int, input().split()))

    for i, num in enumerate(a_list):
        if num == 0:
            print(i+1)



if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

if xl[0]==0:
    print(1)
elif xl[1]==0:
    print(2)
elif xl[2]==0:
    print(3)
elif xl[3]==0:
    print(4)
else:
    print(5)

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:
l=list(map(int,input().split()))
for ll in l:
  if ll==0:
    print(l.index(ll)+1)
    exit()

Submission status: Accepted

Solution code:
x = map(int, input().split())
for num, one in enumerate(x, 1):
    if not one:
        print(num)
        break

Submission status: Accepted

Solution code:
x = [int(n) for n in input().split()]

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

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:
A = list(map(int, input().split()))
ans = 15 - sum(A) 
print(ans)

Submission status: Accepted

Solution code:
def main():
    from operator import itemgetter
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

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

main()

Submission status: Accepted

Solution code:

def resolve():
    A = list(map(int, input().split()))
    idx = A.index(0)
    print(idx+1)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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


def solve(x: "List[int]"):
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = [int(next(tokens)) for _ in range(5)]  # type: "List[int]"
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(LA.index(0)+1)

Submission status: Accepted

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

index = x.index(0)

print(index+1)

Submission status: Accepted

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


def solve(x: "List[int]"):
    a = 1
    for i in x:
        if i == 0:
            print(a)
        a += 1
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = [int(next(tokens)) for _ in range(5)]  # type: "List[int]"
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def main():
    x = list(map(int,input().split(' ')))

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

    print(X.index(0)+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:
    print(i + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
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)
else:
    print(5)

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:
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()))
for i in range(1, len(x)+1):
    if i != x[i-1]:
        print(i)

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve():
    # 数値取得サンプル
    #   1行N項目 x, y = map(int, input().split())
    #   N行N項目 x = [list(map(int, input().split())) for i in range(n)]

    # 文字取得サンプル
    #   1行1項目 x = input()
    x1, x2, x3, x4, x5 = map(int, input().split())

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

    # テストクラス


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

    def test_input_1(self):
        test_input = """0 2 3 4 5"""
        output = """1"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """1 2 0 4 5"""
        output = """3"""
        self.assertIO(test_input, output)

    # 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main()

Submission status: Accepted

Solution code:
ar= input().split(' ')

for x in ar:
	if x=='0':
		print(ar.index(x)+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 = map(int,input().split())

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
List = list(map(int, input().split()))
#A,B = map(int, input().split())

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

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)
else:
    print(5)

Submission status: Accepted

Solution code:
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:
x = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = [int(n) for n in 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(len(X)):
    if X[i]==0:
        print(i+1)
        break

Submission status: Accepted

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

i = 1
for a in A:
  if a == 0:
    print(i)
    break
  i += 1

Submission status: Accepted

Solution code:

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



for i in range(1,6):
    if S[i-1]!=i:
        print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A_list = list(map(int, input().split()))

print(A_list.index(0) + 1)

Submission status: Accepted

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

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

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:
a = list(map(int, input().split()))
for ind, i in enumerate(a):
    if i == 0:
        print(ind+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)
        break

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
a=input().split()
for i in range(5):
    if a[i]=='0':
        print(i+1)

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    #a, b, c, d, e = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    for i in range(1, 6):
        if N[i-1] == 0:
            print(i)

resolve()

Submission status: Accepted

Solution code:
def main():
    import sys
    L = list(map(int, sys.stdin.readline().split()))
    print(L.index(0)+1)







if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
for i, a in enumerate(A):
  if a == 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:
def main():
    X = [int(e) for e in input().split()]

    print(X.index(0) + 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:
        print(i+1)
        exit()

Submission status: Accepted

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

ans=0
now=0
for i in a:
  now+=1
  if i==0:
    ans=now
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


def solve(x: "List[int]"):
    for i in range(len(x)):
        if x[i] == 0:
            print(i+1)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = [int(next(tokens)) for _ in range(5)]  # type: "List[int]"
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

t = 1
for n in x:
    if n == 0:
        print(t)
    t += 1

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split()]
for i in range(5):
    if i + 1 != l[i]:
        print(i+1)
        break

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	x = LI()
	for i, xi in enumerate(x):
		if xi == 0:
			print(i+1)



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = list(input().split())

for i in range(5):
  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:
        S = 1+i
print (S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
for i in range (5):
    if l[i] == 0:
        print(i+1)
        break