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
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

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

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



if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

Solution (Python):
li = list(map(int,input().split()))
for i in range(0,5):
  if li[i] == 0:
    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):
X = list(map(int,input().split()))
for i,x in enumerate(X):
  if x == 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):
n = input().split()
if n[0] == "0":
    print(1)
elif n[1] == "0":
    print(2)
elif n[2] == "0":
    print(3)
elif n[3] == "0":
    print(4)
else:
    print(5)

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

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

Solution (Python):
import sys

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

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

Solution (Python):

import sys

sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)











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


if __name__ == "__main__":
    run()

Solution (Python):
import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

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

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

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

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    X = map(int, input().split())
    for i, x in enumerate(X, start=1):
        if not x:
            print(i)


main()

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

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

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

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
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


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


if __name__ == '__main__':
    main()

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

Solution (Python):
mylist = [int(_) for _ in input().split()]
print(mylist.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)
else:
  print(5)

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())
X=[1]+X
print(X.index(0))

Solution (Python):
def resolve():
    a, b, c, d, e = input().split()
    S = a+b+c+d+e
    print(S.index("0")+1)
resolve()

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

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

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

Solution (Python):
def resolve():
    import sys
    input = sys.stdin.readline
    n = [int(x) for x in input().rstrip().split()]
    print(n.index(0)+1)




if __name__ == "__main__":
    resolve()

Solution (Python):
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
l=list(mi())
for i in range(5):
  if l[i]==0:
    print(i+1)
    sys.exit()

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

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

Solution (Python):
s = list(map(int, input().split()))
for i in range(len(s)):
  if s[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)

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    X = R()
    for i, x in enumerate(X):
        if x == 0:
            print(i+1)
    
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

Solution (Python):
ans=[1,2,3,4,5]
List=list(map(int,input().split()))
for i in range(len(List)):
    if List[i]!=ans[i]:
        print(ans[i])

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

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

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

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

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

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

Solution (Python):

from sys import stdin
input = stdin.readline
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

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

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

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

print(X.index("0") + 1)

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

Solution (Python):
xList = list(map(int, input().split()))
pos = 1
for i in xList:
    if i == 0:
        break
    else:
        pos += 1
print(pos)

Solution (Python):






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

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

Solution (Python):
import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

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

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

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

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

Solution (Python):
x=input().split()
ans=1

for i in x:
  if int(i)==0:
    print(str(ans))
    exit()
  ans+=1

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

import sys


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




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):
l = list(map(int,input().split()))
for i in range(len(l)):
    if l[i] == 0:
        exit(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=[int(_) for _ in input().split(" ")]

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(200000)
import numpy as np


def read():
    x = np.fromstring(input().strip(), dtype=np.int32, sep=" ")
    return x,


def solve(x):
    return np.argmin(x) + 1


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Solution (Python):



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


i = 0

while x_nums[i]!=0:
    i += 1


print(i + 1)

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

Solution (Python):
x_1,x_2,x_3,x_4,x_5=map(int,input().split())
if x_1==0:
    print("1")
if x_2==0:
    print("2")
if x_3==0:
    print("3")
if x_4==0:
    print("4")
if x_5==0:
    print("5")

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

Solution (Python):
apple = list(map(int, input().split()))
for i, j in zip(apple, range(1, 6)):
    if i == 0:
        print(j)
        break
    else:
        pass

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

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

print(ans+1)

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

print(x.index(0)+1)

Solution (Python):
import itertools
import copy
from collections import deque
import heapq
s = list(map(int,input().split()))
for ans,i in enumerate(s):
    if i == 0:
        print(ans+1)
        exit()

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



def main():
    x = [int(i) for i in input().strip().split()]

    return x.index(0)+1


if __name__ == "__main__":
    print(main())

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

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

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(map(int, input().split()))
answer = 1
for v in x:
    if v == 0:
        break
    else:
        answer += 1

print(answer)

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

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

print(x.index(0) + 1)