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
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = na()

print(a.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(len(x)):
    if(x[i] == 0):
        print(i+1)

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

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

Solution (Python):

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

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

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

print(x.index(0) + 1)

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    
    
    
    h_list = [int(x) for x in sys.stdin.readline().split()]  

    
    
    
    

    for i, h in enumerate(h_list):
        if h == 0:
            print(i + 1)


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


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)

Solution (Python):


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

Solution (Python):
def main():
    l = [int(x) for x in input().split()]
    for i, v in enumerate(l):
        if v == 0:
            print(i + 1)
            return


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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

print(A.index(0)+1)

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

print(15-sum(a))

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

print(x.index(0)+1)

Solution (Python):
a=input().split()
number=1
for a_ in a:
    if a_=='0':
        print(number)
    number+=1

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

Solution (Python):


X = list(int(x) for x in input().split())
print(X.index(0)+1)

Solution (Python):
from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18



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



print(A.index(0) + 1)

Solution (Python):
nums = [int(s) for s in input().rstrip().split()]

print(nums.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):
def resolve():
    x = list(map(int,input().split()))
    for i,v in enumerate(x):
        if v == 0:
            print(i+1)
            return
resolve()

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math


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

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

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

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

for i, x in enumerate(xs):
    if x == 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):
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



def solve():
    a = inlt()    
    print(a.index(0) + 1)
            


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")



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


if __name__ == '__main__':
    main()

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

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

resolve()

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

Solution (Python):
x = input().split()
for i in range(5):
  if x[i] == '0':
    print(i+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):
A=list(map(int,input().split()))
print(A.index(0)+1)

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

Solution (Python):
s = input().index('0')
print(s // 2 + 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 = int(x.index(0)) + 1
print(ans)

Solution (Python):
import numpy as np
import functools
import operator

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


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

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

print(ans)

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):
import sys
sys.setrecursionlimit(10**9)

INF = 10**20
def main():
    X = list(map(int,input().split()))

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



if __name__ == "__main__":
  main()

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    l=list(map(int,input().split()))
    for k,v in enumerate(l):
        if v==0:
            print(k+1)
            break
    
resolve()

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

a = x.index(0)

print(a + 1)

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

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

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

for i in range(len(a_list)):
  if a_list[i] == 0:
    print(i+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(5):
    if X[i] == 0:
        print(i + 1)
        break

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

print(x.index(0)+1)

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

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


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()


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

Solution (Python):
*x, = map(int, input().split())
for i in range(1, 6):
    if not i in x:
        print(i)
        break

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

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

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

Solution (Python):

import sys
import math
import itertools
import collections

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def iput(): return int(input())
def mput(): return map(int, input().split())
def lput(): return list(map(int, input().split()))

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

if __name__ == "__main__":
    solve()

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    a=LIST()
    ans=[1,2,3,4,5]
    for i in ans:
        if not i in a:
            print(i)
if __name__ == '__main__':
    do()

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(5):
    if X[i]==0:
        print(i+1)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce, lru_cache  
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)


X = list(int(x) for x in input().split())
for i, x in enumerate(X, start=1):
    if i != x:
        print(i)
        exit()

Solution (Python):

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


print(xs.index(0)+1)

Solution (Python):
from math import *

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

def cins(): 
    return input.split()

def cino(test=False): 
    if not test:
        return int(input())
    else: 
        return input()

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

def ssplit(): 
    return list(input().split())

def printlist(l): 
    for i in l:
        print(i,end=" ")

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

if __name__ == '__main__':
    main()

Solution (Python):

import sys


def solve(x: "List[int]"):
    for i in range(len(x)):
        if x[i] == 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()))

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

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

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

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

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

Solution (Python):
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    x_arr = list(map(int, _in[0].split(' ')))  
    
    for i,x in enumerate(x_arr):
        if x==0:
            ans = i+1
    
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():

    x = list(in_nn())
    ans = x.index(0)
    print(ans + 1)


if __name__ == '__main__':
    main()

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

def main():
    X = list(map(int, readline().rstrip().split()))
    for i, x in enumerate(X):
        if x != i + 1:
            print(i + 1)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''


 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]






x=limii()

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

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, 5 + 1):
  if not i in x:
    print(i)
    exit()

Solution (Python):
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

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

  
if __name__ == '__main__':
  main()

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)

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()))

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

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

if __name__ == '__main__':
    main()

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

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

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

print(x.index(0) + 1)

Solution (Python):
x = [int(i) for i in 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:
        print(i+1)
        exit()

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

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

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

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

    return 0

if __name__ == "__main__":
    main()

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

ans = 0

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

print(ans)

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

print(x.index(0) + 1)

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

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

ans = lst.index(0)
print(ans + 1)

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

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

Solution (Python):
import sys

readline = sys.stdin.readline

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

if __name__ == "__main__":
    main()

Solution (Python):
def ZZ(): return list(map(int, input().split()))
def Z(): return int(input())
 
x1,x2,x3,x4,x5 = ZZ()

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

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

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

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right


from functools import reduce
from pprint import pprint


INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

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

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

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

Xs = list(mapint())
print(Xs.index(0)+1)

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

X = rl()

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

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

Solution (Python):
a=list(map(int,input().split()))
for i in range(5):
    if a[i]==0: print(i+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):
print(list(map(int,input().split())).index(0)+1)

Solution (Python):



from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

def main():
    tinn=1; 
    for tin in range(tinn):
        a=list(map(int,input().split()))
        print(a.index(0)+1)




BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    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(b"\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()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
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()
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == "__main__":
    main()

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
        print(ans)
        break

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
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(5):
  if x[i]==0:
    print(i+1)
    break

Solution (Python):
*X, = map(int, input().split())
print(X.index(0) + 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(5):
    if A[i]==0:
        print(i+1)
        exit()

Solution (Python):
if __name__ == '__main__':
    a = [int(i) for i in input().split()]

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    X = list(map(int, input().split()))
    for i in range(5):
        if X[i] == 0:
            print(i+1)
            break

if __name__ == '__main__':
    main()

Solution (Python):

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