#include <bits/stdc++.h>
using namespace std;
long long int exp(long long int x, long long int y) {
  long long int res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long int modinv(long long int x) { return exp(x, 1000000007 - 2); }
long long int add(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a + b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int sub(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a - b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int mul(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a * b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int Log2n(long long int n) { return (n > 1) ? 1 + Log2n(n / 2) : 0; }
long long int fac[100009];
long long int ncr_mod(long long int n, long long int k) {
  long long int ans = fac[n];
  ans *= modinv(fac[k]);
  ans %= 1000000007;
  ans *= modinv(fac[n - k]);
  ans %= 1000000007;
  return ans;
}
vector<long long int> v_prime;
void Sieve(long long int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (prime[p]) v_prime.emplace_back(p);
}
vector<long long int> v_factor;
void factors(long long int n) {
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        v_factor.emplace_back(i);
      else {
        v_factor.emplace_back(i), v_factor.emplace_back(n / i);
      };
    }
  }
  sort(v_factor.begin(), v_factor.end());
}
void out(vector<long long int>& a) {
  for (long long int i = 0; i < a.size(); i++) cout << a[i] << " ";
  cout << endl;
}
void ask(long long int x, long long int y) {
  cout << "? " << x << " " << y << endl;
}
signed main() {
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    for (long long int i = 2; i < n; i++) {
      if (n % i == 0) {
        cout << i << (n / i);
        break;
      }
    }
  }
}

### Prompt

Develop a solution in CPP to the problem described below:

    There was once young lass called Mary,    
    Whose jokes were occasionally scary.    
    On this April's Fool    
    Fixed limerick rules    
    Allowed her to trip the unwary.  
      
    Can she fill all the lines  
    To work at all times?  
    On juggling the words  
    Right around two-thirds  
    She nearly ran out of rhymes.  
    

Input

The input contains a single integer a (4 ≤ a ≤ 998). Not every integer in the range is a valid input for the problem; you are guaranteed that the input will be a valid integer.

Output

Output a single number.

Examples

Input


35


Output


57


Input


57


Output


319


Input


391


Output


1723

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int exp(long long int x, long long int y) {
  long long int res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long int modinv(long long int x) { return exp(x, 1000000007 - 2); }
long long int add(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a + b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int sub(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a - b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int mul(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  a = ((a * b) % 1000000007 + 1000000007) % 1000000007;
  return a;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int Log2n(long long int n) { return (n > 1) ? 1 + Log2n(n / 2) : 0; }
long long int fac[100009];
long long int ncr_mod(long long int n, long long int k) {
  long long int ans = fac[n];
  ans *= modinv(fac[k]);
  ans %= 1000000007;
  ans *= modinv(fac[n - k]);
  ans %= 1000000007;
  return ans;
}
vector<long long int> v_prime;
void Sieve(long long int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (prime[p]) v_prime.emplace_back(p);
}
vector<long long int> v_factor;
void factors(long long int n) {
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        v_factor.emplace_back(i);
      else {
        v_factor.emplace_back(i), v_factor.emplace_back(n / i);
      };
    }
  }
  sort(v_factor.begin(), v_factor.end());
}
void out(vector<long long int>& a) {
  for (long long int i = 0; i < a.size(); i++) cout << a[i] << " ";
  cout << endl;
}
void ask(long long int x, long long int y) {
  cout << "? " << x << " " << y << endl;
}
signed main() {
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    for (long long int i = 2; i < n; i++) {
      if (n % i == 0) {
        cout << i << (n / i);
        break;
      }
    }
  }
}

```