# -*- coding:utf-8 -*-
def binary_search(num,arr):
n=len(arr)
left=0
right=n-1
if n==0:
return '数组为空!'
while left<=right:
mid=(left+right)//2
if arr[mid]<num:
left=mid+1
elif arr[mid]>num:
right=mid-1
else:
return '找到元素位置为'+str(mid)
return '没有找到该元素!'
if __name__ == '__main__':
arr = sorted(map(int,input().split(',')))#map函数将int()作用在每个字符上
num=int(input())
print(arr)
print(binary_search(num,arr))