#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }

#define MOD 1000000007LL
#define INF (1LL<<60)

ll CS = 26;
//ll CS = 3;

ll N;
string s;
VVI nxt;

// i以降でcが最初に出てくる位置
ll pos(ll i, ll c) {
//	cout<<"pos "<<i<<" "<<c<<endl;
	return nxt[c][i];
//	RANGE(j, i, N) if(s[j]=='a'+c) return j;
//	return -1;
}

using pll = pair<int, int>;

vector<pll> memo;
//map<pair<ll, ll>, pair<ll, pair<ll, ll>>> memo;

// iにいるときの最良の残りstepと選んだ文字
pll f(int i) {
//	cout<<"f "<<i<<" "<<c<<endl;
	// 範囲外なのでaでOK
	if(i>=N) return MP(1, 0);

	if(memo[i].first!=-1) return memo[i];

	auto lans = MP(1<<30, 0);
	REP(j, CS) {
		int p = pos(i, j);
		pll lv;
		// ないのでjでいい
		if(p==-1) lv = MP(1, j);
		else {
			lv = f(p+1);
			lv = MP(lv.first+1, j);
		}
		if(lv.first < lans.first) {
			lans = lv;
		}
	}
//	cout<<"f "<<i<<" "<<c<<" -> "<<lans<<endl;
	return memo[i] = lans;
}



int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	while(cin>>s) {
		N = s.size();
		memo = vector<pll>(N, MP(-1, 0));
		nxt = VVI(CS, VI(N+1, -1));
		for(int i=N-1;i>=0;i--) {
			REP(j, CS) if(s[i]-'a'==j) nxt[j][i] = i; else if(i+1<N) nxt[j][i] = nxt[j][i+1];
		}
		auto vv = f(0);
		string ans;
		ll p = 0;
		while(1) {
			auto v = f(p);
			int c = v.second;
			p = pos(p, c);
			ans.PB('a'+c);
			if(p==-1) break;
			p++;
		}
		REP(i, N) REP(j, CS) {
//			DD(i);DD(j);DD(f(i, j));
		}
//		DD(ans);
		cout<<ans<<endl;

//		break;
	}
	
	return 0;
}


Measured memory_bytes: 44308