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.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class P514A {
    //static long m=1000000007;
    static BigInteger ways(int N,  int K) {
        BigInteger ret = BigInteger.ONE;
        for(int i=N;i>=N-K+1;i--)
        {
             ret = ret.multiply(BigInteger.valueOf(i));
            
        }
        for (int j = 1; j<=K; j++) {
            ret = ret.divide(BigInteger.valueOf(j));
        }
       
            ret=ret.mod(BigInteger.valueOf(1000000007));
        
        return ret;
    }
    public static int prime(int n)
    {
        int f=1;
        if(n==1)
            return 0;
        for(int i=2;i<=(Math.sqrt(n));)
        {
            if(n%i==0)
            {
                f=0;
                break;
            }
            if(i==2)
                i++;
            else
                i+=2;
        }
        if(f==1)
            return 1;
        else 
            return 0;
    }
/*public static long gcd(long x,long y)
{
    if(x%y==0)
        return y;
    else return gcd(y,x%y);
}*/
    public static BigInteger fact(int n)
    {
        BigInteger f=BigInteger.ONE;
        for(int i=1;i<=n;i++)
        {
            f=f.multiply(BigInteger.valueOf(i));
        }
        //f=f.mod(BigInteger.valueOf(m));
        return f;
    }
public static int gcd(int x,int y)
{
    if(x%y==0)
        return y;
    else return gcd(y,x%y);
}
public static int max(int a,int b)
{
    if(a>b)
        return a;
    else
        return b;
}
public static int min(int a,int b)
{
    if(a>b)
        return b;
    else 
        return a;
}
    public static void main(String[] args) throws Exception{
        
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder("");
        //int t=Integer.parseInt(br.readLine());
    //  while(t-->0)
        //{
        //int n=Integer.parseInt(br.readLine());
        //String l[]=br.readLine().split(" ");
        //long n=Long.parseLong(br.readLine());
        //l=br.readLine().split(" ");
    //  int m=Integer.parseInt(l[0]);
        //long m=Long.parseLong(l[0]);
        //char ch=a.charAt();
    //  char c[]=new char[n];
        //int a[]=new int[n];
        /*for(int i=0;i<n;i++)
        {
            
        }*/
        //int a[][]=new int[n][n];
        //HashMap<Integer,Integer>hm=new HashMap<Integer,Integer>();
        //HashMap<Integer,String>hm=new HashMap<Integer,String>();
        //HashMap<Integer,Long>hm=new HashMap<Integer,Long>();
        //hm.put(1,1);
        //HashSet<Integer>hs=new HashSet<Integer>();
        //HashSet<Long>hs=new HashSet<Long>();
        //HashSet<String>hs=new HashSet<String>();
        //hs.add(x);
        //Stack<Integer>s=new Stack<Integer>();
        //s.push(x);
        //s.pop(x);
        //Queue<Integer>q=new LinkedList<Integer>();
        //q.add(x);
        //q.remove(x);
        //long a[]=new long[n];
        //long x=Long.parseLong(l[0]);
        //for(int i=0;i<n;i++)
        //{
            //a[i]=Long.parseLong(l[i]);
        //}
        //int min=100000000;
    //  String a=br.readLine();
        //for(int i=0;i<n;i++)
        //{
            //a[i]=Integer.parseInt(l[i]);
        //}
        // char a[]=c.toCharArray();
        //char ch=l[0].charAt(0);
        //long c1=(long)Math.ceil(n/(double)a);
        //Arrays.sort(a);
          // int f1[]=new int[26];
           //int f2[]=new int[26];
        //for(int i=0;i<n;i++)
        //{
        //int x=a.charAt(0);
            //f1[x-97]++;
        //}
        /*for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                
            }
        }*/
        long n=Long.parseLong(br.readLine());
        long a[]=new long[19];
        int c=0;
        long x=n;
        while(x!=0)
        {
            a[c++]=x%(long)10;
            x=x/(long)10;
        }
        for(int i=0;i<c;i++)
        {
            if(i==c-1)
            {
                 x=a[i];
                 if(x>=5&&x!=9)
                 a[i]=(long)9-a[i];
                
            }
            else
            {   
                 x=a[i];
         if(x>=5)
         a[i]=(long)9-a[i];}
        }
        for(int i=c-1;i>=0;i--)
            System.out.print(a[i]);
        
        //}
    }
}