#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c = a % i_7;
    if(c >= 0) return c;
    return c + i_7;
}
long long po(long a, long b){
    if(b == 0) return 1;
    
    long long z = po(a , b / 2);
    z = mod(z * z);
    if(b % 2 != 0) z = mod(a * z);
    return z;
}

bool prime_(int n){
    if(n == 1){
        return false;
    }else if(n == 2){
        return true;
    }else{
        for(int i = 2; i <= std::sqrt(n); i++) if(n % i == 0) return false;
        return true;
    }
}

long long gcd_(long long a, long long b){
    if(a < b) std::swap(a,b);
    if(a % b == 0) return b;
    else return gcd_(b, a % b);
}

long long lcm_(long long x, long long y){
    return (x / gcd_(x,y)) * y;
}

using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

int main(){
  //using namespace std;
  
  string s;
  cin>>s;
  int n = s.size();
  string ans;
  for(int i = n - 1; i >= 0; i--){
    if(s[i] == '6') ans.push_back('9');
    else if(s[i] == '9') ans.push_back('6');
    else ans.push_back(s[i]);
  }
  cout << ans << endl;
  return 0;
}
#include <bits/stdc++.h>
#define int int64_t

using namespace std;

const int LG=2e5+5;

int a[LG], viz[LG];

vector<int> v[LG];

void dfs(int nod)
{
    viz[nod]=1;
    for (auto el:v[nod])
        if (!viz[el])
            dfs(el);
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    map<int,int> m;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        m[a[i]]++;
    }
    int ans=m.size();
    for (int i=1;i<=n/2;i++)
    {
        int f=a[i];
        int s=a[n+1-i];
        if (f!=s)
        {
            v[f].push_back(s);
            v[s].push_back(f);
        }
    }
    for (int i=1;i<=n;i++)
    {
        if (!viz[a[i]])
        {
            dfs(a[i]);
            ans--;
        }
    }
    cout<<ans;
    return 0;
}