bool IsPrime(long long numar)
{

	if ((numar & 1) == 0)
	{
		if (numar == 2)
		{
			return true;
		}
		else
		{
			return false;
		}
	}

	long long num = (long long)sqrt(numar);

	for (int i = 2; i <= num; i += 1)
	{
		if ((numar % i) == 0)
		{
			return false;
		}
	}
	return true;
}

 bool IsMersennePrime(long long n)
{

	 long long x = (long long ) (pow(2, n) - 1);


//	 return true;
	return IsPrime((long long)x);
}


 void job_1()
 {
	 for (long long i = 2; i <= 257; i++)
	 {
		 if (IsMersennePrime(i))
			 cout << "Nr prim: " << i << "\tMersenne Prime: " << (long long)(pow(2, i) - 1) << endl;
	 }
 }