// Program 81: Vampire Number

import java.util.*;
class VampireNumber {
    static String sortDigits(String s) {
        char[] a = s.toCharArray();
        Arrays.sort(a);
        return new String(a);
    }
public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    String digits = String.valueOf(n);
    if (n < 10 || digits.length() % 2 != 0) {
        System.out.println("NOT A VAMPIRE NUMBER");
        return;
    }
int half = digits.length() / 2;
int low = (int) Math.pow(10, half - 1), high = (int) Math.pow(10, half) - 1;
boolean found = false;
for (int a = low; a <= high && !found; a++) {
    if (n % a != 0) {
        continue;
    }
int b = n / a;
if (b < low || b > high || (a % 10 == 0 && b % 10 == 0)) {
    continue;
}
if (sortDigits("" + a + b).equals(sortDigits(digits))) {
    System.out.println("VAMPIRE NUMBER: " + a + " x " + b);
    found = true;
}
}
if (!found) {
    System.out.println("NOT A VAMPIRE NUMBER");
}
}
}