#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+1e4,M=1e3+1e2;
const ll Maxn=0x3ffffff,Minm=-0x3ffffff;
ll n,cnt;
ll f[N];
bool check(ll k)
{
    for(ll i=2;i<=sqrt(k);i++)
        if(k%i==0)return false;
    return true;
}
signed main()
{
    cin>>n;
    for(ll i=1;i<=32;i++)f[i]=f[i-1]*2+1,cnt++;;
    for(ll i=2;i<=cnt;i++)
    {
        if(f[i]>n)exit(0);
        if(check(f[i]))printf("M(%d)=%d\n",i,f[i]);
    }
}