Problem:
Score : 100 points

Problem Statement

Cat Snuke is learning to write characters.
Today, he practiced writing digits 1 and 9, but he did it the other way around.

You are given a three-digit integer n written by Snuke.
Print the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.

Constraints

111 \leq n \leq 999

n is an integer consisting of digits 1 and 9.

Input

Input is given from Standard Input in the following format:

n

Output

Print the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.

Sample Input 1

119

Sample Output 1

991

Replace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.

Sample Input 2

999

Sample Output 2

111

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_line(& mut buf).ok();
    let s = buf.trim();
    //println!("{}", s);
    let mut v: Vec<char> = s.chars().collect();
    //println!{"pre len {}", v.len()};
    for i in &mut v {
        if *i == '1' {*i = '9';}
        else if *i == '9' {*i = '1';}
        //println!("{}", *i);
    }
    //println!{"aft len {}", v.len()};
    println!{"{}{}{}", v[0], v[1], v[2]};
}