#include <bits/stdc++.h> #define int long long using namespace std; int a[100005],n; int ans1[100005],ans2[100005]; bool cmp () { for (int i = 1;i <= n;i++) { if (ans1[i] < ans2[i]) { return 0; } if (ans1[i] > ans2[i]) { return 1; } } return 0; } string s; signed main () { cin >> s; n = s.length(); for (int i = 1;i <= n;i++) { a[i] = s[i - 1] - '0'; } int x = 9 - a[1]; for (int i = 1;i <= n;i++) { ans1[i] = (a[i] + x) % 10; } for (int i = 1;i <= n;i++) { if (ans1[i] < 9) { ans1[i]++; break; } } x = 8 - a[1]; for (int i = 1;i <= n;i++) { ans2[i] = (a[i] + x) % 10; } ans2[1]++; if (cmp()) { for (int i = 1;i <= n;i++) { cout << ans1[i]; } } else { for (int i = 1;i <= n;i++) { cout << ans2[i]; } } cout << endl; return 0; }