#include<bits/stdc++.h>
#define ll long long
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
    ios
    ll p;
    cin>>p;
    if(p==0)
    {
        cout<<10;
        return 0;
    }

    if(p==1)
    {
        cout<<1;
        return 0;
    }

    vector<ll>d;
    for(int i=9;i>=2;i--) {
        while(p%i==0)
        {
            d.push_back(i);
            p /= i;
        }
    }
    if(p!=1)
    {
        cout<<-1;
        return 0;
    }
    sort(d.begin(), d.end());
    for(int i:d)
        cout<<i;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
vector<int> primeFactors(int n) {
    vector<int> res;
    while (n % 2 == 0) { res.push_back(2); n /= 2; }
    for (int i = 3; i * i <= n; i += 2)
        while (n % i == 0) { res.push_back(i); n /= i; }
    if (n > 1) res.push_back(n);
    return res;
}

int main() {
    int n, two = 0, three = 0; bool cannot = false;
    cin >> n;
    if (n == 0) {
        cout << 10;
        return 0;
    } else if (n == 1) {
        cout << 1;
        return 1;
    }
    vector<int> f = primeFactors(n), digits;
    for (int i : f) {
        if (i >= 10) cannot = true;
        two += (i == 2);
        three += (i == 3);
    }
    if (cannot) cout << -1;
    else {
        for (int i = 0; i < two / 3; ++i) digits.push_back(8);
        two %= 3;
        for (int i = 0; i < min(two, three); ++i) digits.push_back(6);
        two -= min(two, three);
        three -= min(two, three);
        while (two--) digits.push_back(2);
        while (three--) digits.push_back(3);
        for (int i : f)
            if (i != 2 && i != 3) digits.push_back(i);
        sort(digits.begin(), digits.end());
        for (int i : digits) cout << i;
    }
    return 0;
}