#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
const int N = 1e2 + 10;
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long m_pow(long long x, long long n, long long m) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = (res * x) % m;
    x = (x * x) % m;
    n >>= 1;
  }
  return res % m;
}
int main() {
  int n;
  cin >> n;
  for (int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) {
      int a = n / i;
      cout << min(a, i) << max(a, i) << endl;
    }
  return 0;
}
