Binary search program using java

/* To implement Binary Search on sorted list  */

import java.util.Scanner;
public class BinarySearch
{
 public static void main(String args[])
 {
  Scanner sc = new Scanner(System.in);
  int i,flag=0,lower=0,upper,mid;

  System.out.println("Enter size of the list");
  int n=sc.nextInt();
 
  int a[]=new int[n];
  upper=n-1;
  System.out.println("Enter sorted list elements : ");
  for(i=0;i<n;i++)
  {
   a[i]=sc.nextInt();
  }
   
  System.out.println("sorted list elements : ");
  for(i=0;i<n;i++)
  {
   System.out.println("\t"+a[i]);
  }
  System.out.println("Enter element to search ");
  int num=sc.nextInt(); 
  for(mid=(lower+upper)/2;lower<=upper;mid=(lower+upper)/2)
  {
   if(a[mid]==num)
   {
    flag=1;
    break;
   }
  
   if(num > a[mid])
    lower=mid+1;
   else
    upper=mid-1;
  }
  if(flag==1)
   System.out.println(num+" is found at position : "+(mid+1));
  else
   System.out.println("Element is not presetn in the list");
  sc.close();
 }
}

output :