#include <bits/stdc++.h>
using namespace std;
long long convert(long long n) {
  string bin = "";
  while (n) {
    bin += ((n % 2) + '0');
    n /= 2;
  }
  reverse(bin.begin(), bin.end());
  long long res = stoll(bin);
  return res;
}
bool isPrime(long long n);
long long power(long long x, long long y);
long long gcd(long long a, long long b);
long long int mod = 1000000007;
void solve() {
  string s;
  cin >> s;
  if (s[0] != '9' && 9 - (s[0] - '0') < 5) {
    int z = (s[0] - '0');
    s[0] = (9 - z) - 'a' - 111;
  }
  for (int i = 1; i < s.size(); i++) {
    if (9 - (s[i] - '0') < 5) {
      int z = s[i] - '0';
      s[i] = (9 - z) - 'a' - 111;
    }
  }
  cout << s;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long testcase = 1;
  while (testcase--) solve();
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
}
bool isPrime(long long n) {
  if (n == 1) return false;
  if (n == 2 || n == 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return ((power(x, y / 2) % mod) * (power(x, y / 2) % mod)) % mod;
  else
    return ((((x % mod) * ((power(x, y / 2) % mod))) % mod *
             (power(x, y / 2) % mod)) %
            mod) %
           mod;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
