//Time complexity: O(N)
//Auxiliary Space: O(1)
#include <stdio.h>

int search(int arr[],int sz,int src){
    for(int i=0;i<sz;i++){
        if(arr[i]==src){
            printf("%d",i);
        }
    }  
}

int main(){
    int arr[10];
    // int arr[] = { 2, 3, 4, 10, 40 };
    for(int i=0;i<10;i++){
        scanf("%d",&arr[i]);
    }
    int src=8;
    int sz=sizeof(arr)/sizeof(arr[0]);//total array size of filled
    //elements devide by one eliment size
    search(arr,sz,src);
}