First Bad Version

import java.util.*;
import java.io.*;

public class Main {

  public static int firstBadVersion(int n) {
    //write your code here
    int l = 1, r = n;
    int bad = 0;
    while(l <= r){
        int mid = l + (r - l) / 2;
        if(isBadVersion(mid)){
            bad = mid;
            r = mid - 1;
        }
        else{
            l = mid + 1;
        }
    }

    return bad;
  }

  static int bad = 0;
  public static boolean isBadVersion(int val) {
    if (val >= bad) {
      return true;
    }
    else {
      return false;
    }
  }

  public static void solve(int n, int fbv) {
    bad = fbv;
    System.out.println(firstBadVersion(n));
  }

  public static void main(String[]args) {
    //input work
    Scanner scn = new Scanner(System.in);
    int n = scn.nextInt();
    int fbv = scn.nextInt();

    solve(n, fbv);
  }
}