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

Solution (Python):
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'
    
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in range(base**n):s=[tb//(base**bt)%base for bt in range(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
 
YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase

read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
input=lambda: sys.stdin.readline().rstrip()

class Tree:
    def __init__(self,inp_size=None,ls=None,init=True,index=1):
        self.LCA_init_stat=False
        self.ETtable=[]
        if init:
            if ls==None:
                self.stdin(inp_size,index=index)
            else:
                self.size=len(ls)+1
                self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def stdin(self,inp_size=None,index=1):
        if inp_size==None:
            self.size=int(input())
        else:
            self.size=inp_size
        self.edges,_=GI(self.size,self.size-1,index=index)
        return
    
    def listin(self,ls,index=0):
        self.size=len(ls)+1
        self.edges,_=GI(self.size,self.size-1,ls,index=index)
        return
 
    def dfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.size
        v[x]=root_v
        while q:
            c=q.pop()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def bfs(self,x,func=lambda pr,prv,nx,dist:prv+dist,root_v=0):
        q=deque([x])
        v=[None]*self.size
        v[x]=root_v
        while q:
            c=q.popleft()
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=func(c,v[c],nb,d)
        return v
 
    def parent(self,x):
        return self.dfs(0,func=lambda pr,prv,nx,dist:pr,root_v=-1)
 
    def topological_sort(self,x):  
        tps=[]
        q=deque([x])
        v=[None]*self.size
        v[x]=0
        while q:
            c=q.popleft()
            tps.append(c)
            for nb,d in self.edges[c]:
                if v[nb]==None:
                    q.append(nb)
                    v[nb]=0
        return tps
 
    def EulerTour(self,x):
        q=deque()
        q.append(x)
        self.depth=[None]*self.size
        self.depth[x]=0
        self.ETtable=[]
        self.ETdepth=[]
        self.ETin=[-1]*self.size
        self.ETout=[-1]*self.size
        cnt=0
        while q:
            c=q.pop()
            if c<0:
                ce=~c
            else:
                ce=c
                for nb,d in self.edges[ce]:
                    if self.depth[nb]==None:
                        q.append(~ce)
                        q.append(nb)
                        self.depth[nb]=self.depth[ce]+1
            self.ETtable.append(ce)
            self.ETdepth.append(self.depth[ce])
            if self.ETin[ce]==-1:
                self.ETin[ce]=cnt
            else:
                self.ETout[ce]=cnt
            cnt+=1
        return
    
    def LCA_init(self,root):
        self.EulerTour(root)
        self.st=SparseTable(self.ETdepth,init_func=min,init_idl=inf)
        
        self.LCA_init_stat=True
        return
    
    def LCA(self,root,x,y):
        if self.LCA_init_stat==False:
            self.LCA_init(root)
        xin,xout=self.ETin[x],self.ETout[x]
        yin,yout=self.ETin[y],self.ETout[y]
        a=min(xin,yin)
        b=max(xout,yout,xin,yin)
        id_of_min_dep_in_et=self.st.query_id(a,b+1)
        return self.ETtable[id_of_min_dep_in_et]
 
    def __str__(self):
        return  str(self.edges)
 
    def show(self):
        if all([all([d==1 for nd,d in edge]) for edge in self.edges]):
            print( [[nd for nd,d in edge] for edge in self.edges] )
        else:
            print(self)
 
class SparseTable: 
    def __init__(self,ls,init_func=min,init_idl=float('inf')):
        self.func=init_func
        self.idl=init_idl
        self.size=len(ls)
        self.N0=self.size.bit_length()
        self.table=[ls[:]]
        self.index=[list(range(self.size))]
        self.lg=[0]*(self.size+1)
        
        for i in range(2,self.size+1):
            self.lg[i]=self.lg[i>>1]+1
 
        for i in range(self.N0):
            tmp=[self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) for j in range(self.size)]
            tmp_id=[self.index[i][j] if self.table[i][j]==self.func(self.table[i][j],self.table[i][min(j+(1<<i),self.size-1)]) else self.index[i][min(j+(1<<i),self.size-1)] for j in range(self.size)]
            self.table+=[tmp]
            self.index+=[tmp_id]
    
    
    def query(self,l,r):
        if r>self.size:r=self.size
        
        N=self.lg[r-l]
        return self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))])
    
    
    def query_id(self,l,r):
        if r>self.size:r=self.size
        
        N=self.lg[r-l]
        a,b=self.index[N][l],self.index[N][max(0,r-(1<<N))]
        if self.table[0][a]==self.func(self.table[N][l],self.table[N][max(0,r-(1<<N))]):
            b=a
        return b
    
    
    def right_bound(self,pos,x):
        k=(self.size-pos).bit_length()
        for j in range(k)[::-1]:
            nx=pos+(1<<j)
            if nx<n and self.query(pos,nx+1)<=x:
                pos+=(1<<j)
        return pos
    
    
    def left_bound(self,pos,x):
        k=pos.bit_length()
        for j in range(k)[::-1]:
            nx=pos-(1<<j)
            if 0<=nx and self.query(nx,pos+1)<=x:
                pos-=(1<<j)
        return pos
 
    def __str__(self):
        return str(self.table[0])
 
    def print(self):
        for i in self.table:
            print(*i)
 
show_flg=False
show_flg=True
ans=0


print(15-sum(LI()))

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

Solution (Python):

import sys


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



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)]  
    solve(x)

if __name__ == '__main__':
    main()

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

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

print(ans+1)

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

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

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

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

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

Solution (Python):
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)

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

Solution (Python):
import sys
input = sys.stdin.readline

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

print(15 - x1 - x2 - x3 - x4 -x5)

Solution (Python):
x = list(map(int,input().split(' ')))
print(x.index(0)+1)

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

Solution (Python):


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

Solution (Python):
x = list(map(int, input().split()))
for i in x:
    if i == 0:
        print(x.index(i)+1)
        exit()

Solution (Python):


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

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

Solution (Python):
a, b, c, d, e = map(int, input().split())
arr = [a, b, c, d, e]

for i in arr:
    if arr[i] == 0:
        print(i + 1)
        break

Solution (Python):
x = list(map(int, input().split()))
ans = 15 - sum(x)
print(ans)

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

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

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

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

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

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

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

Solution (Python):
import sys
n = [int(i) for i in input().split()]

print(n.index(0) + 1)

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

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

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

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
a1,a2,a3,a4,a5 = map(int, input().split())
ans = [a1,a2,a3,a4,a5]
print(ans.index(0)+1)

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

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

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

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

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    A = list(map(int, input().split()))
    print(A.index(0) + 1)
resolve()

Solution (Python):
from __future__ import division, print_function
import os
import sys
from __builtin__ import xrange as range
from cStringIO import StringIO
from future_builtins import ascii, filter, hex, map, oct, zip
from io import IOBase
import __pypy__


BUFSIZE = 8192
class FastI(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = StringIO()
        self.newlines = 0

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count("\n") + (not b)
            ptr = self._buffer.tell()
            self._buffer.seek(0, 2), self._buffer.write(b), self._buffer.seek(ptr)
        self.newlines -= 1
        return self._buffer.readline()
class FastO(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = __pypy__.builders.StringBuilder()
        self.write = lambda s: self._buffer.append(s)
    def flush(self):
        os.write(self._fd, self._buffer.build())
        self._buffer = __pypy__.builders.StringBuilder()
def print(*args, **kwargs):
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
sys.stdin, sys.stdout = FastI(sys.stdin), FastO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()




















def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7


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

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

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

Solution (Python):
l = input().split(" ")
print(l.index("0") + 1)

Solution (Python):
arr=list(map(int,input().split()))

print(arr.index(0)+1)

Solution (Python):
import sys


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


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
A = list(map(int, input().split())) 
place = A.index(0)
print(place+1)

Solution (Python):
x = [int(i) for i in input().split()]
if x[0] == 0:
    print(1)
elif x[1] ==0:
    print(2)
elif x[2] ==0:
    print(3)
elif x[3] ==0:
    print(4)
else:
    print(5)

Solution (Python):


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

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

Solution (Python):
a,b,c,d,e=list(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)

Solution (Python):
a=input().split()
x=0
for n in a:
  x+=1
  if n=="0":
    aa=x
print(aa)

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

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

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

for i in range(1, 6):
  if i not in X:
    print(i)

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

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

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

Solution (Python):
num=list(map(int,input().split()))
if 5 not in num:
	print(5)
elif 4 not in num:
	print(4)
elif 3 not in num:
	print(3)
elif 2 not in num:
	print(2)
elif 1 not in num:
	print(1)

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    x = LI()
    print(x.index(0)+1)
    return



if __name__ == '__main__':
    solve()

Solution (Python):
def main():
    x = map(int, input().split())
    for i, n in enumerate(x, 1):
        if n == 0:
            print(i)
            exit()

if __name__ == '__main__':
    main()

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

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

Solution (Python):
x_l = list(map(int, input().split()))

index = x_l.index(0)
print(index + 1)

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

cnt = 0
for i,s in enumerate(l):
  
  if s == 0:
    print(i+1)
    exit()
  else:
    pass

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

print(xs.index(0)+1)

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

Solution (Python):
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)

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

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

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

X = LI()
print(X.index(0) + 1)

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

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

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

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

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

Solution (Python):
x_list = list(map(int,input().split()))
position_zero = x_list.index(0)
print(position_zero+1)

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

Solution (Python):
x = list(map(int, input().split()))
s = sum([1,2,3,4,5])
print(s - sum(x))

Solution (Python):
print(input().split().index("0") + 1)

Solution (Python):

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

Solution (Python):
a = set(map(int, input().split()))
ans = set(range(6)) - a
print(*ans)

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

Solution (Python):
data = list(map(int, input().split()))
for idx, a in enumerate(data):
    if a == 0:
        print(idx+1)
        exit()

Solution (Python):
a = list(map(int, input().split()))
isFound = False
b = 0
while isFound == False:
    if a[b] != 0:
        b += 1
        continue
    else:
        print(b + 1)
        isFound = True

Solution (Python):
x = map(int,input().split())
y =15
print(y-sum(x))

Solution (Python):
X = list(map(int, input().split()))
if X[0] == 0:
    print(1)
elif X[1] == 0:
    print(2)
elif X[2] == 0:
    print(3)
elif X[3] == 0:
    print(4)
else:
    print(5)

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

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

Solution (Python):
x = list(map(int, input().split()))
ans = 15
for _ in range(len(x)):
    ans -= x[_]

print(ans)

Solution (Python):
S = input()
n = 0
nums = S.split(" ")
for index, num in enumerate(nums):
    if int(num) == 0:
        n = index + 1
 
 
 
print(n)

Solution (Python):
S = input()
n = 0
nums = S.split(" ")
for index, num in enumerate(nums):
    if int(num) == 0:
        n = index + 1



print(n)

Solution (Python):
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)

Solution (Python):



def get_input() -> list:
    """
    標準入力を取得する.

    Returns:
        list: 標準入力
    """
    x = list(map(int, input().split()))
    return x


def main(x: list) -> None:
    """
    求解処理を行う.

    Args:
        x (list): 数列
    """
    
    ans = x.index(0) + 1

    
    print(ans)


if __name__ == "__main__":
    x = get_input()
    main(x)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c,d,e = map(int, input().split())
ans = 15 - sum([a,b,c,d,e])
print(ans)

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

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

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

Solution (Python):
import sys

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

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

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

Solution (Python):
import sys






























fast_reader=sys.stdin.readline
fast_writer=sys.stdout.write

def input():
	return fast_reader().strip()

def print(*argv):
	fast_writer(' '.join((str(i)) for i in argv))
	fast_writer('\n')

def list_input():
	return list(map(int, input().split()))

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



l=list_input()
print(15-sum(l))

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

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

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

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

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

print(x.index(0)+1)

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

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

print(x.index(0) + 1)

Solution (Python):
x = input().split()
print(x.index('0') + 1)

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
list = input().split()

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

Solution (Python):
s=list(map(str,input().split()))
print(s.index('0')+1)

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

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

Solution (Python):
lista = list(map(int,input().split()))
for n in range(1,6):
  if lista[n-1] != n:
    print(n)

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

Solution (Python):
import sys
input = sys.stdin.readline

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

print(a.index(0)+1)

Solution (Python):
def read():
    return list(map(int, input().split()))

x = read()
ans = x.index(0) + 1
print(ans)

Solution (Python):
s = input().split(" ")
for i in range(len(s)):
    if s[i]=='0':
        print(i+1)

Solution (Python):
import sys

if __name__ == "__main__":
    for line in sys.stdin:
        v = line.split(' ')
        for i, x in enumerate(v):
            if int(x) == 0:
                print(i + 1)
                break

Solution (Python):
N_list = [int(i) for i in input().split()]
i = 0
for n in N_list:
    i += 1
    if n == 0:
        print(i)

Solution (Python):
print(input().find('0')//2+1)

Solution (Python):
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)

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

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

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

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

print(x.index(0) + 1)

Solution (Python):
x = list(input().split())
print(x.index("0") + 1)

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

Solution (Python):
print(input().find('0')//2+1)

Solution (Python):
[print(j+1)for j,k in enumerate([i for i in input().split()]) if k=='0']

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

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

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

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

s = 1
for i in a:
  if i == 0:
    print(s)
    exit()
  s += 1

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

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

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

Solution (Python):
def solve():
	arr = [int(x) for x in input().split()]
	for i in range(5):
		if arr[i] == 0:
			return i + 1
print(solve())

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

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

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

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

Solution (Python):
from typing import List


def main():
    lst: List[int] = map(int, input().split())

    for index, num in enumerate(lst, 1):
        if num == 0:
            print(index)


if __name__ == "__main__":
    main()

Solution (Python):
X = list(map(int, input().split()))
count = 1
for I in X:
  if I == 0:
    print(count)
    exit
  count += 1

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

Solution (Python):
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")

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

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

Solution (Python):
list1 = list(map(int, input().split()))


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

Solution (Python):
ins = list(map(int, input().split()))
if ins[0] == 0:
	print(1)
elif ins[1] == 0:
	print(2)
elif ins[2] == 0:
	print(3)
elif ins[3] == 0:
	print(4)
elif ins[4] == 0:
	print(5)
else :
  print("something wrong.")

Solution (Python):
print(15 - sum([*map(int, input().split())]))

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

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

Solution (Python):
X = input().split()
for i, x in enumerate(X):
    if x == "0":
        print(i + 1)
        break

Solution (Python):
print(15-sum(map(int,input().split())))

Solution (Python):
print(15 - sum(map(int,input().split())))

Solution (Python):
X = input()


inputs = X.split(' ')




x1 = int(inputs[0])
x2 = int(inputs[1])
x3 = int(inputs[2])
x4 = int(inputs[3])
x5 = int(inputs[4])

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

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

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