#include <stdio.h>
#include <stdlib.h>
#include <limits.h>

int compare(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}

int solution(int num) {
    if (num == 0) return 0;
    if (num == 1) return 1;
    
    int factors[32];
    int factorCount = 0;
    
    // Try to factor using digits 9 down to 2
    for (int digit = 9; digit >= 2; digit--) {
        while (num % digit == 0) {
            factors[factorCount++] = digit;
            num /= digit;
        }
    }
    
    // If num is not 1, it means we couldn't factor completely
    if (num > 1) {
        return 0;
    }
    
    // Sort factors in ascending order to get minimum number
    qsort(factors, factorCount, sizeof(int), compare);
    
    // Convert to integer
    long long result = 0;
    for (int i = 0; i < factorCount; i++) {
        result = result * 10 + factors[i];
    }
    
    // Check 32-bit signed integer limit
    if (result > INT_MAX) {
        return 0;
    }
    
    return (int) result;
}

int main() {
    int num;
    scanf("%d", &num);
    int result = solution(num);
    printf("%d\n", result);
    return 0;
}