corejava-array: java program to search a Number and its smaller and larger numbers too

import java.util.Scanner;


public class NumberSearch {
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
int N=input.nextInt();
int[] numbers=new int[N];
for(int i=0;i<numbers.length;i++){
numbers[i]=input.nextInt();
}
int searchNumber=input.nextInt();
int smallerCount=0;
int greaterCount=0;
boolean isExist=false;
for(int i=0;i<numbers.length;i++){
if(numbers[i]==searchNumber){
isExist=true;
}else if(numbers[i]>searchNumber){
greaterCount++;
}else if(numbers[i]<searchNumber){
smallerCount++;
}
}
System.out.println(isExist?"YES":"NO");
System.out.println(smallerCount);
System.out.println(greaterCount);

}
}

import java.util.ArrayList;
import java.util.Scanner;
class ElementSearch1
{
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);
ArrayList<Integer> list = new ArrayList<>();
int arraySize = scanner.nextInt();
int count = 0,grval=0,lesval=0;
while (count < arraySize)
{
list.add(scanner.nextInt());
count++;
}
int ele=scanner.nextInt();
for(int i = 0; i < list.size(); i++)
{
if(list.get(i) > ele)
{
grval++;
}
else
{
lesval++;
}
}
System.out.println(list.indexOf(ele)==-1?"NO":"YES");
System.out.println(lesval);
System.out.println(grval);
}
}