蓝桥杯 查找整数

package Lanqiao;


import java.util.Scanner;
// 找舒在数组里面的位置
//


public class Main3 {


public static void main(String[] args) {
int count = 0;
Scanner scanner = new Scanner(System.in);
int n =  scanner.nextInt();
int a[] = new int[n];
for(int i = 0;i<a.length;i++){
a[i] = scanner.nextInt();
}
int m = scanner.nextInt();
scanner.close();
for(int j= 0; j < a.length;j++){
if(m==a[j]){
System.out.println(j+1);
break;
}else if(m !=a[j]){
count++;
}
if(count== a.length){
System.out.println(-1);
break;
}
}
}
}