Shortest Subsequence
Easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
You are given a DNA sequence consisting of characters and .
Your task is to find the shortest DNA sequence that is not a subsequence of the original sequence.
Input
One line contains a DNA sequence with characters.
Output
Print the shortest DNA sequence that is not a subsequence of the original sequence. If there are several solutions, you may print any of them.
Examples
Input #1
Answer #1
Submissions 385
Acceptance rate 28%