#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <climits>

using namespace std;

#define FOR (i,m,n) for (_typeof(n) i = m; i<W(n); ++i)
#define REP (i,n) for (_typeof(n) i=0; i<n; ++i)
#define DBG (x) cout<< #x <<": "<< x <<"\n";

typedef long long ll;
typedef pair<int,int> ii;

int main() {
	string s;
	while(cin >> s){
		if(s == "END") return 0;
		
		int n = s.length();
		int i = n - 1;	
		
		while(s[i] == '0'){
			i--;
		}
		
		s[i]--;
		
		if(i == 0 && s[i] == '0') cout << "0\n";
		else cout << s << "\n";
	}

	return 0;
}