Problem: Luke Skywalker gave Chewbacca an integer number x. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit t means replacing it with digit 9 - t. 

Help Chewbacca to transform the initial number x to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.

Input

The first line contains a single integer x (1 ≤ x ≤ 1018) — the number that Luke Skywalker gave to Chewbacca.

Output

Print the minimum possible positive number that Chewbacca can obtain after inverting some digits. The number shouldn't contain leading zeroes.

Examples

Input

27


Output

22


Input

4545


Output

4444

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;





public class A {



	public static void main(String[]args)throws IOException {
		FastReader sc = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		String str = sc.next();
		int n = Character.getNumericValue(str.charAt(0));
		out.print((n != 9 && n >= 5 ) ? (9 - n) : n);


		for (int i = 1; i < str.length(); i++) {
			n = Character.getNumericValue(str.charAt(i));
			if (n >= 5)
				out.print(9 - n);

			else
				out.print(n);
		}

		out.close();
	}





// public static euclidTriplet euclidExtended(int a, int b) {
// 	if (b == 0)
// 		return new euclidTriplet(1, 0, a);

// 	euclidTriplet ans = euclidExtended(b, a % b);

// 	return new euclidTriplet(ans.y, ans.x - (a / b) * ans.y, ans.gcd);
// }


// public static int  gcd(int a, int b) {
// 	if (a == 0)
// 		return b;

// 	return gcd(b % a, a);
// }

}

// class euclidTriplet {
// 	int x, y, gcd;
// 	euclidTriplet(int x, int y, int gcd) {
// 		this.x = x;
// 		this.y = y;
// 		this.gcd = gcd;
// 	}
// }


// class comp implements Comparator<long []> {
// 	public int compare(long [] arr1, long[] arr2) {
// 		if ((2 * arr2[0] + arr2[1]) > (2 * arr1[0] + arr1[1]))
// 			return 1;

// 		else
// 			return -1;
// 	}
// }


class FastReader {

	BufferedReader br;
	StringTokenizer st;

	public FastReader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}

	String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException  e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	int [] nextIntArray(int n) {
		int [] arr = new int[n];
		for (int i = 0; i < n; i++)
			arr[i] = nextInt();

		return arr;

	}


	long nextLong() {
		return Long.parseLong(next());
	}

	long [] nextLongArray(int n) {
		long [] arr = new long[n];
		for (int i = 0; i < n; i++)
			arr[i] = nextLong();

		return arr;

	}

	double nextDouble() {
		return Double.parseDouble(next());
	}

	String nextLine() {
		String str = "";
		try {
			str = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		return str;
	}

}