#include <iostream>
#include<bits/stdc++.h>
typedef long long int ll;


using namespace std;

vector<pair<char,ll>> maxi(vector<pair<char,ll>> a , vector<pair<char,ll>> b){
	
	int n1 = a.size();
	int n2 = b.size();
	int n = min(n1,n2);
	for(int i=0;i<n;i++){
		if(a[i].first > b[i].first){
			return a;
		}
		else if(a[i].first<b[i].first){
			return b;
		}
		else{
			if(a[i].second>b[i].second){
				return a;
			}
			else if(a[i].second<b[i].second){
				return b;
			}
		}
	}
	if(n1>n2){
		return a;
	}
	return b;
	
}
vector<pair<char,ll>> dfs(string &s,ll l , ll r){
	int n = s.size();
	char max_element='a';
	
	for(int i=l;i<=r;i++){
		max_element=max(max_element,s[i]);
	}
	vector<ll> max_element_occurence;
	
	for(int i=l;i<=r;i++){
	if(s[i]==max_element){
	     max_element_occurence.push_back((ll)i);
	}
	}
	
	int size = max_element_occurence.size();
	vector<pair<char,ll>> temp;
	
	if(l<=max_element_occurence[0]-1){
		temp = dfs(s,l,max_element_occurence[0]-1);
	}
	
	for(int i=0;i<size-1;i++){
		ll l1 = max_element_occurence[i]+1;
		ll r1 = max_element_occurence[i+1]-1;
		if(l1<=r1){
			temp = maxi(temp,dfs(s,l1,r1));
		}
	}
	
	if(r>=max_element_occurence[size-1]+1){
		temp = maxi(temp,dfs(s,max_element_occurence[size-1]+1,r));
	}
	
	temp.insert(temp.begin(),{max_element,size});
	return temp;
	
	
}
int main() {
	// your code goes here
	string s;
	cin>>s;
	ll n = s.size();
	
	vector<pair<char,ll>> arr=dfs(s,0,n-1);
	string ans="";
	
	for(int i=0;i<arr.size();i++){
		int a = arr[i].second;
		for(int j=0;j<a;j++){
			ans=ans+arr[i].first;
		}
	}
	
	cout<<ans<<endl;
	
	
	
	return 0;
}