public static int prime(int a) {
    boolean x = true;
    int counter = 2;
    int primecounter = 1;
    int i;
  while (x) {
  for (i = 0; i < 100; i++) {
    for (int j = 2; j < Math.sqrt(i); j++) {
      if (i%j == 0) counter++;
    }
    if (counter == 2) primecounter++;
    if (primecounter == a) {
      x = false;
    }
  }
  return i;
  }