#include <stdio.h>

int solution(int n) {
    // Rotation mapping function
    int rotate(int digit) {
        switch(digit) {
            case 0: return 0;
            case 1: return 1;
            case 6: return 9;
            case 8: return 8;
            case 9: return 6;
            default: return -1; // Invalid
        }
    }
    
    int original = n;
    int rotated = 0;
    
    while (n > 0) {
        int digit = n % 10;
        n /= 10;
        
        // Check if digit is rotatable
        int rotatedDigit = rotate(digit);
        if (rotatedDigit == -1) {
            return 0; // false
        }
        
        // Build rotated number
        rotated = rotated * 10 + rotatedDigit;
    }
    
    // Check if different from original
    return rotated != original;
}

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