#include <iostream>
#include <cstdint>
 
typedef int_fast64_t Int;
const Int FAILURE = -1;
 
Int zagadka(int x) {
	if (x < 10) return x;
 
	unsigned n = x;
	int counters[10] = { 0 };
	for (int i = 9; i >= 2; i--) {
		while (n % i == 0) {
			n /= i;
			counters[i] += 1;
		}
	}
 
	if (n > 1) return FAILURE;
 
	Int acc = 0;
	for (Int i = 2; i < 10; i++) {
		for (int k = 0; k < counters[i]; k++) {
			acc = 10*acc + i;
		}
	}
	return acc;
}
 
int main() {
	int n;
	while (std::cin >> n) {
		Int result = zagadka(n);
		if (result == FAILURE) {
			std::cout << "Rozwiazanie nie istnieje" << std::endl;
		} else {
			std::cout << result << std::endl;
		}
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGludD4KCnR5cGVkZWYgaW50X2Zhc3Q2NF90IEludDsKY29uc3QgSW50IEZBSUxVUkUgPSAtMTsKCkludCB6YWdhZGthKGludCB4KSB7CglpZiAoeCA8IDEwKSByZXR1cm4geDsKCQoJdW5zaWduZWQgbiA9IHg7CglpbnQgY291bnRlcnNbMTBdID0geyAwIH07Cglmb3IgKGludCBpID0gOTsgaSA+PSAyOyBpLS0pIHsKCQl3aGlsZSAobiAlIGkgPT0gMCkgewoJCQluIC89IGk7CgkJCWNvdW50ZXJzW2ldICs9IDE7CgkJfQoJfQoJCglpZiAobiA+IDEpIHJldHVybiBGQUlMVVJFOwoJCglJbnQgYWNjID0gMDsKCWZvciAoSW50IGkgPSAyOyBpIDwgMTA7IGkrKykgewoJCWZvciAoaW50IGsgPSAwOyBrIDwgY291bnRlcnNbaV07IGsrKykgewoJCQlhY2MgPSAxMCphY2MgKyBpOwoJCX0KCX0KCXJldHVybiBhY2M7Cn0KCmludCBtYWluKCkgewoJaW50IG47Cgl3aGlsZSAoc3RkOjpjaW4gPj4gbikgewoJCUludCByZXN1bHQgPSB6YWdhZGthKG4pOwoJCWlmIChyZXN1bHQgPT0gRkFJTFVSRSkgewoJCQlzdGQ6OmNvdXQgPDwgIlJvendpYXphbmllIG5pZSBpc3RuaWVqZSIgPDwgc3RkOjplbmRsOwoJCX0gZWxzZSB7CgkJCXN0ZDo6Y291dCA8PCByZXN1bHQgPDwgc3RkOjplbmRsOwoJCX0KCX0KCXJldHVybiAwOwp9

MQoyCjkKMTAKMTEKNzIKMTA3Mzc0MTgyNAoxMDAwMDAwMDAwCjI0NDE0MDYyNQ==

1
2
9
10
11
72
1073741824
1000000000
244140625