#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


char s[N];
int sum, v;

void sub(int idx) {
	sum -= s[idx] == '3';
	v -= s[idx] - '0';

	if (s[idx] == '0') {
		s[idx] = '9';
		sub(idx - 1);
	} else s[idx]--;

	sum += s[idx] == '3';
	v += s[idx] - '0';
}

int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	for (int i = 1; i < n + 1; i++) 
		if (s[i] == '3') {
			s[i] = '2';
			for (int j = i + 1; j < n + 1; j++) s[j] = '9';
			break;
		}
	for (int i = 1; i < n + 1; i++) v += s[i] - '0';
	while (v % 3 == 0 || sum) {
		sub(n);
		sum = 0, v = 0;
		for (int i = 1; i < n + 1; i++) 
			if (s[i] == '3') {
				s[i] = '2';
				for (int j = i + 1; j < n + 1; j++) s[j] = '9';
				break;
			}
		for (int i = 1; i < n + 1; i++) v += s[i] - '0';
	}
	for (int i = 1; i < n + 1; i++)
		if (s[i] != '0') {
			printf("%s\n", s + i);
			return 0;
		}
	return 0;
}