Seeking the smallest prime number greater than the integer n

com.company.Util package;

import java.util.Scanner;

public class Test09 {
public static void main(String[] args) {

System.out.println("-------------------------------------");

//----------------------------------------------------------
Scanner scanner = new Scanner(System.in);
int m= scanner.nextInt();
zuixiao(m);
}
public static void zuixiao(int n){
while(true){
n++;
if(zhiyou(n)){
System.out.println(n);
break;
}
}
}
public static boolean zhiyou(int s){
boolean flag=true;
int i;
for(i=2;i<s;i++){
if(s%i==0){

return false;
}}
return true;
}
}