#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    b = b >> 1;
    a = (a * a) % m;
  }
  return res % m;
}
long long modInv(long long n, long long m) { return power(n, m - 2, m); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fac(long long n) {
  if (n == 0 || n == 1) return 1;
  return n * fac(n - 1);
}
int setbits(long long n) {
  int c = 0;
  while (n) {
    n = n & (n - 1);
    c++;
  }
  return c;
}
long long combination(long long n, long long r, long long p) {
  if (r == 0) return 1;
  long long fac[n + 1];
  fac[0] = 1;
  for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
  return (fac[n] * modInv(fac[r], p) % p * modInv(fac[n - r], p) % p) % p;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  for (int i = 2; i < n; i++)
    if (n % i == 0) {
      cout << i << n / i;
      break;
    }
  return 0;
}
