package oj.test;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;
public class Demo2aa {
/**
* @提取不重复的整数
* 输入一个int型整数,按照从右向左的阅读顺序,返回一个不含重复数字的新的整数。
*/
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str = sc.nextLine();
LinkedList<Character> link = new LinkedList<Character>();
str = new StringBuffer(str).reverse().toString();
while(!str.isEmpty()){
char ch = str.charAt(0);
if(ch>='0' && ch<='9' ){
while(str.contains(ch+"")){
str = str.replace(ch, '&');
}
link.add(ch);
}
else
str = str.substring(1);
}
//System.out.println(str);
Iterator<Character> it = link.iterator();
char[] arr = new char[link.size()];
int flag = 0;
while(it.hasNext())
arr[flag++]=it.next();
String result = "";
for(int i = 0;i<arr.length;i++){
result = result + arr[i];
}
while(result.startsWith("0"))
result = result.substring(1);
if(result.length()==0)
System.out.println(0);
else
System.out.println(result);
}
}