#include <bits/stdc++.h>

using namespace std;

//是不是质数
bool IsPrime(int n) {
    for (int i = 2; i <= n / i; i++)
        if (n % i == 0)return false;
    return true;
}

//是不是回文数
bool isHuiWen(int n) {
    int i = n;//n备份到了i,一会我们要操作i,i会变化，n操持不动
    int m = 0;//反向回文数结果
    while (i) {
        m = m * 10 + i % 10;
        i /= 10;
    }
    return m == n;
}

int main() {
    //1e8
    for (int i = 5; i <= 100000000; i++)
        if (IsPrime(i) && isHuiWen(i))
            cout << i << ",";
    return 0;
}