import java.util.Scanner;
boolean isPrime(int n)
{
	for(int i =2 ; i<=n/2 ;i++)
	{
		if( n % i == 0)
		{
			return false
		}
	}
	return true;
}
public class Mersenne_prime
    
    for(int i =0 ;i < 100 ,i++)
    {
    	int s = math.pow(2,i)-1;
    	boolean b = isPrime(s);
    	System.out.println(" Number :  "+ s + " , Prime : "b);

    }
}