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

def solve():
    input = sys.stdin.readline
    X = [int(i) for i in input().split()]
    for i, x in enumerate(X):
        if x == 0: print(i + 1)

    return 0

if __name__ == "__main__":
    solve()

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

Solution (Python):

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)








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

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

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

i = xs.index(0)

print(i+1)

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    x = lmis()
    print(x.index(0)+1)
    

main()

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

X=[int(i) for i in input().split()]
for i,x in enumerate(X):
  if x==0:
    print(i+1)
    break

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

print(line.index(0) + 1)

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Solution (Python):

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

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

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

for i in range(5):
    if x[i]==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()))
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):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

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


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


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


def get_all_int():
    return map(int, open(0).read().split())

def rangeI(it, l, r):
    for i, e in enumerate(it):
        if l <= i < r:
            yield e
        elif l >= r:
            break

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

X = get_nums_l()

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):
"""
~~ Author : Bhaskar
~~ Dated : 07~06~2020
"""

import sys
from bisect import *
from math import floor,sqrt,ceil,factorial as F,gcd,pi,log
from itertools import chain,combinations,permutations,accumulate
from collections import Counter,defaultdict,OrderedDict,deque
from array import array
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
mod = 1000000007
ch = "abcdefghijklmnopqrstuvwxyz"
lcm = lambda a,b : (a*b)//gcd(a,b)
setbit = lambda x : bin(x)[2:].count("1")

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

if __name__ == "__main__":
    try:
        sys.stdin = open("input.txt","r")
    except :
        pass
    solve()

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 num in a:
    if num == 0:
        print(a.index(num)+1)

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

hoge = [a,b,c,d,e]

for i in range(5):
    if hoge[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()))

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

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

Solution (Python):


import sys
sys.setrecursionlimit(300000)


def solve(x: "List[int]"):
    ret = 0
    for i, v in enumerate(x):
        if v == 0:
            ret = i + 1
    print(ret)
    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):

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

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

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

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

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

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

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

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

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

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
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]





A = li()

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

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

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

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

Solution (Python):

import sys

stdin = sys.stdin
ns = lambda: stdin.readline().rstrip() 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys

def input(): return 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 INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7

A = LIST()
ans = A.index(0) + 1
print(ans)

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush


from functools import lru_cache


def input(): return sys.stdin.readline()[:-1]
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

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


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



if __name__ == "__main__":
    main()

Solution (Python):
import math as mt


def ro(n):
  return mt.floor(mt.sqrt(n))
def ya():
  print("Yes")
  return
def na():
  print("No")
  return



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


print(lis.index(0)+1)

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

a = [int(x) for x in input().split()]

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

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

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

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

Solution (Python):
nii=lambda:map(int,input().split())
lnii=lambda:list(map(int,input().split()))

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

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

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

Solution (Python):

import bisect
import collections
import sys

sys.setrecursionlimit(1000000)
ACMOD = 1000000007
INF = 1 << 62



def solve(x: "List[int]"):
    print(x.index(0)+1)
    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()))
print(x.index(0) + 1)

Solution (Python):


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

Solution (Python):
import sys




X = list(map(int, sys.stdin.readline().rstrip().split()))
print(X.index(0) + 1)

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

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

print(a.index(0)+1)

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

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

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

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

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

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

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

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

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, x in enumerate(X):
    if x == 0:
        print(i + 1)
        break

Solution (Python):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  l=LI()

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


print(main())

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

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

Solution (Python):
al = list(map(int, input().split()))
print(al.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 sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
import decimal


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True

    @staticmethod
    def fact(N):
        res = {}
        tmp = N
        for i in range(2, int(N ** 0.5 + 1) + 1):
            cnt = 0
            while tmp % i == 0:
                cnt += 1
                tmp //= i
            if cnt > 0:
                res[i] = cnt
        if tmp != 1:
            res[tmp] = 1
        if res == {}:
            res[N] = 1
        return res


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    X = Scanner.map_int()
    print(X.index(0) + 1)


def main():
    
    
    
    
    
    solve()


if __name__ == "__main__":
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
X = list(map(int,input().split()))
for i in range(5):
    if X[i]==0:
        print(i+1)
        exit()

Solution (Python):

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

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


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

print(a_L.index(0)+1)

Solution (Python):
import math

li = list(map(int, input().split(" ")))

print(li.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 = 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):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

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

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:
        ans = i + 1
print(ans)

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

Solution (Python):
print(15-sum([int(x) for x in input().split()]))

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

li = list(map(int,stdin.readline().rstrip().split()))

print(li.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():
    x = [int(xi) for xi in input().split()]
    print(x.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):
    """Prints the values to a stream, or to sys.stdout by default."""
    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):
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

Solution (Python):



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


a = lmp()
print(a.index(0)+1)

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7



x = LIST()

print(x.index(0)+1)

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

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

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    x = input_number_list()
    print(x.index(0)+1)

if __name__ == '__main__':
    main()

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

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

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

if __name__ == '__main__':
    main()

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

print(X.index(0)+1)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

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

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

print(A.index(0) + 1)

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

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

solve()

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy


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

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




print(arr.index(0)+1)

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

print(A.index(0) + 1)

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

Solution (Python):




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

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

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

Solution (Python):
A = [int(_n) for _n in input().split()]
for i in range(len(A)):
    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()))
for i in range(5):
    if X[i]==0:
        print(i+1)

Solution (Python):
print(15 - sum([int(a) for a in input().split()]))

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

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

print(l.index(0)+1)

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):


import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return x if y == 0 else gcd(y, x%y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

X = LI()
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)

Solution (Python):

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

print(x.index(0)+1)