#include <iostream>
using namespace std;
 
int main() {
  int n;
  cin >> n;
  int divizor = 2, estePrim = 1;
  while (divizor < n) { // Parcurgem numerele de la 2 la n-1
    if (n % divizor == 0) { // Daca n se divide la divizor
      estePrim = 0; // Atunci n nu este prim
    }
    ++divizor;
    cout << divizor;
  }
  // Numarul 1 nu e prim prin conventie, desi nu are
  // niciun divizor intre 1 si el insusi
  if (n == 1) {
    estePrim = 0;
  }
  if (estePrim == 1) {
    cout << "Numarul dat este prim";
  } else {
    cout << "Numarul dat nu este prim";
  }
  return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgaW50IG47CiAgY2luID4+IG47CiAgaW50IGRpdml6b3IgPSAyLCBlc3RlUHJpbSA9IDE7CiAgd2hpbGUgKGRpdml6b3IgPCBuKSB7IC8vIFBhcmN1cmdlbSBudW1lcmVsZSBkZSBsYSAyIGxhIG4tMQogICAgaWYgKG4gJSBkaXZpem9yID09IDApIHsgLy8gRGFjYSBuIHNlIGRpdmlkZSBsYSBkaXZpem9yCiAgICAgIGVzdGVQcmltID0gMDsgLy8gQXR1bmNpIG4gbnUgZXN0ZSBwcmltCiAgICB9CiAgICArK2Rpdml6b3I7CiAgICBjb3V0IDw8IGRpdml6b3I7CiAgfQogIC8vIE51bWFydWwgMSBudSBlIHByaW0gcHJpbiBjb252ZW50aWUsIGRlc2kgbnUgYXJlCiAgLy8gbmljaXVuIGRpdml6b3IgaW50cmUgMSBzaSBlbCBpbnN1c2kKICBpZiAobiA9PSAxKSB7CiAgICBlc3RlUHJpbSA9IDA7CiAgfQogIGlmIChlc3RlUHJpbSA9PSAxKSB7CiAgICBjb3V0IDw8ICJOdW1hcnVsIGRhdCBlc3RlIHByaW0iOwogIH0gZWxzZSB7CiAgICBjb3V0IDw8ICJOdW1hcnVsIGRhdCBudSBlc3RlIHByaW0iOwogIH0KICByZXR1cm4gMDsKfQ==

MTE=

11