#abc260a. [abc260_a]A Unique Letter
[abc260_a]A Unique Letter
Problem Statement
You are given a string of length .
Print a character that occurs only once in .
If there is no such character, print -1
instead.
Constraints
- is a string of length consisting of lowercase English letters.
Input
Input is given from Standard Input in the following format:
Output
Print the answer. If multiple solutions exist, you may print any of them.
Sample Input 1
pop
Sample Output 1
o
o
occurs only once in pop
.
Sample Input 2
abc
Sample Output 2
a
a
, b
, and c
occur once each in abc
, so you may print any of them.
Sample Input 3
xxx
Sample Output 3
-1
No character occurs only once in xxx
.