import java.util.*;
public class LargestSubsequence {
    public String getLargest(String s) {
        int pos  = 0;
        char best;
        String ret = "";
        while (pos < s.length()) {
        best = s.charAt(pos);
        if(pos == s.length()-1) {
            ret += s.charAt(pos);
            break;
        }
        for(int i = pos+1; i < s.length();i++){
            if(s.charAt(i) > best) {
            best = s.charAt(i);
            pos  = i;
            }
        }
        ret += best;
        pos++;
        }
        return ret;     
    }
}