#include <bits/stdc++.h>
using namespace std;
bool ispalindrome(long long int x)
{
long long int temp=x,rev=0;
while(temp!=0)
{
rev=rev*10+temp%10;
temp=temp/10;
}
if(rev==x)
return 1;
else
return 0;
}
bool isprime(long long int num)
{
int flag=0;
for(int i=2;i<=sqrt(num);i++)
{
if(num%i==0)
{
flag=1;
return 0;
}
}
return 1;
}
int main() {
// your code goes here
long long int n;
scanf("%lld",&n);
for(long long int i=n;;i++)
{
if((isprime(i))&&(ispalindrome(i)))
{
cout<<i;
exit(0);
}
}
//cout<<n<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmJvb2wgaXNwYWxpbmRyb21lKGxvbmcgbG9uZyBpbnQgeCkKewogbG9uZyBsb25nIGludCB0ZW1wPXgscmV2PTA7CiB3aGlsZSh0ZW1wIT0wKQogewogIHJldj1yZXYqMTArdGVtcCUxMDsKICB0ZW1wPXRlbXAvMTA7CiB9CmlmKHJldj09eCkKcmV0dXJuIDE7CmVsc2UKcmV0dXJuIDA7Cn0KIApib29sIGlzcHJpbWUobG9uZyBsb25nIGludCBudW0pCnsKIGludCBmbGFnPTA7CiBmb3IoaW50IGk9MjtpPD1zcXJ0KG51bSk7aSsrKQogewogICBpZihudW0laT09MCkKICAgewogICAgIGZsYWc9MTsKICAgICByZXR1cm4gMDsKICAgfQogfQogcmV0dXJuIDE7Cn0KaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglsb25nIGxvbmcgaW50IG47CglzY2FuZigiJWxsZCIsJm4pOwoJZm9yKGxvbmcgbG9uZyBpbnQgaT1uOztpKyspCgl7CgkgIGlmKChpc3ByaW1lKGkpKSYmKGlzcGFsaW5kcm9tZShpKSkpCgkgIHsKCSAgY291dDw8aTsKCSAgZXhpdCgwKTsKCSAgfQoJfQoJLy9jb3V0PDxuPDxlbmRsOwoJcmV0dXJuIDA7Cn0g