#include <iostream>
using namespace std;
int main() {
int a = 12;
cin >> a;
int i = 2, este_prim = 1;
while (i < a) { // Parcurgem numerele de la 2 la a-1
if (a % i == 0) { // Daca a se divide la i
este_prim = 0; // Atunci a nu este prim
}
++i;
}
// Numarul 1 nu e prim prin conventie, desi nu are
// niciun divizor intre 1 si el insusi
if (a == 1) {
este_prim = 0;
}
int ogl = 0;
while (a != 0) {
ogl = ogl * 10 + a % 10;
a = a / 10;
}
int i1 = 2, este_prim1 = 1;
while (i1 < ogl) {
if (ogl % i1 == 0) {
este_prim == 0;
}
++i1;
}
if (ogl == 1) {
este_prim1 == 0;
}
if (este_prim == 1 && este_prim1 == 1) {
cout << " DA ";
} else {
cout << " NU ";
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgaW50IGEgPSAxMjsKICBjaW4gPj4gYTsKICBpbnQgaSA9IDIsIGVzdGVfcHJpbSA9IDE7CiAgd2hpbGUgKGkgPCBhKSB7IC8vIFBhcmN1cmdlbSBudW1lcmVsZSBkZSBsYSAyIGxhIGEtMQogICAgaWYgKGEgJSBpID09IDApIHsgLy8gRGFjYSBhIHNlIGRpdmlkZSBsYSBpCiAgICAgIGVzdGVfcHJpbSA9IDA7IC8vIEF0dW5jaSBhIG51IGVzdGUgcHJpbQogICAgfQogICAgKytpOwogIH0KICAvLyBOdW1hcnVsIDEgbnUgZSBwcmltIHByaW4gY29udmVudGllLCBkZXNpIG51IGFyZQogIC8vIG5pY2l1biBkaXZpem9yIGludHJlIDEgc2kgZWwgaW5zdXNpCiAgaWYgKGEgPT0gMSkgewogICAgZXN0ZV9wcmltID0gMDsKICB9CiAgaW50IG9nbCA9IDA7CiAgd2hpbGUgKGEgIT0gMCkgewogIAlvZ2wgPSBvZ2wgKiAxMCArIGEgJSAxMDsKICAJYSA9IGEgLyAxMDsKICB9CiAgaW50IGkxID0gMiwgZXN0ZV9wcmltMSA9IDE7CiAgd2hpbGUgKGkxIDwgb2dsKSB7CiAgCWlmIChvZ2wgJSBpMSA9PSAwKSB7CiAgCQllc3RlX3ByaW0gPT0gMDsKICAJfQogIAkrK2kxOwogIH0KICBpZiAob2dsID09IDEpIHsKICAJZXN0ZV9wcmltMSA9PSAwOwogIH0KICBpZiAoZXN0ZV9wcmltID09IDEgJiYgZXN0ZV9wcmltMSA9PSAxKSB7CiAgCWNvdXQgPDwgIiBEQSAiOwogIH0gZWxzZSB7CiAgCWNvdXQgPDwgIiBOVSAiOwogIH0KICByZXR1cm4gMDsKfQ==