D_Queue.cpp

#include <map>
#include <set>
#include <stack>
#include <vector>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define loop(o, n) for (int i = 0; i < n; i++)
#define py cout << "YES" << endl
#define pn cout << "NO" << endl
using namespace std;
// #define m 1e9+7

int main()
{
    int t = 1;
    // cin >> t;
    while (t--)
    {
        string s;
        cin >> s;
        for (int i = 0; i < s.length(); i++)
        {

            int tmp = s[i] - '0';
            if (tmp >= 5 && tmp <= 9)
            {
                tmp = 9 - tmp;
                s[i] = tmp + '0';
            }
        }
        if (s.front() == '0')
            s.front() = '9';
        cout << s;
    }
    return 0;
}