public class asd
{
	public static boolean IsPrime(int n)
	{
		if(n == 2) return true;
		int i = 2;
		while(i<n)
		{
			if(n%i==0) return false;
			i++;
		}
		return true;
	}
public static int next(int n)
{
	int x = n+1;
	while(true)
	{
		if (IsPrime(x))
		{
			return x;
		}
		else
		{
			x++;
		}
	}
}
}