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-----
0 2 3 4 5

-----Sample Output-----
1

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

Source: atcoder | Difficulty: EASY


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


(x_1, x_2, x_3, x_4, x_5) = list(map(int, input().split()))
ls = [x_1, x_2, x_3, x_4, x_5]
num = ls.index(0)
print(num + 1)


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


sum = 0
for i in map(int, input().split()):
	sum += i
print(15 - sum)


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


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


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


print(input().replace(' ', '').find('0') + 1)


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


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


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


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


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


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


import sys
from collections import deque, defaultdict, Counter
from itertools import accumulate, product, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush
from math import ceil, floor, sqrt, gcd, inf
from copy import deepcopy
import numpy as np
import scipy as sp
INF = inf
MOD = 1000000007
X = [int(i) for i in input().split()]
tmp = 0
res = 0
res = 15 - sum(X)
print(res)


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


(x1, x2, x3, x4, x5) = map(int, input().split())
l = [x1, x2, x3, x4, x5]
print(l.index(0) + 1)


Xs = list(input().split())
print(int(Xs.index('0')) + 1)


print(input().index('0') // 2 + 1)


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


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


import numpy as np
x = np.array(list(map(int, input().split())))
y = np.arange(1, 6)
print(-sum(x - y))


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


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


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


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


(a, b, c, d, e) = map(str, input().split())
s = [a, b, c, d, e]
num = s.index('0')
print(num + 1)


print(input().split().index('0') + 1)


num = map(int, input().split())
s = sum(num)
print(15 - s)


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


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


X = list(map(int, input().split()))
sum = 0
for i in X:
	sum += i
print(15 - sum)


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


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


import sys
input = iter(sys.stdin.read().splitlines()).__next__
sys.setrecursionlimit(10000)
A = list(map(int, input().split()))
for i in range(len(A)):
	if A[i] == 0:
		print(i + 1)


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


x = input()
for i in range(1, 6):
	if str(i) not in x:
		print(i)
		break


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


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


import sys, os.path
sys.setrecursionlimit(10 ** 5)

def mod():
	return 10 ** 9 + 7

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

def ii():
	return int(sys.stdin.readline())

def li():
	return list(sys.stdin.readline().strip())

def mii():
	return map(int, sys.stdin.readline().split())

def lii():
	return list(map(int, sys.stdin.readline().strip().split()))

def solve():
	a = lii()
	print(1 + a.index(0))
for _ in range(1):
	solve()


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


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, bisect
import sys
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
stdin = sys.stdin
ni = lambda : int(ns())
nf = lambda : float(ns())
na = lambda : list(map(int, stdin.readline().split()))
nb = lambda : list(map(float, stdin.readline().split()))
ns = lambda : stdin.readline().rstrip()
x = na()
print(x.index(0) + 1)


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


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


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

def __starting_point():
	print(main())
__starting_point()