Skip to content
UPEEC

First Non-Repeating Character

Easy#strings#hashing· solved by 0 · time limit 2.0 s

Print the first character that appears exactly once in the string, or -1 if there is none.

Input

One lowercase word.

Output

The character or -1.

Constraints

1 to 10510^5 letters.

Sample 1

Input

leetcode

Output

l

Sample 2

Input

aabb

Output

-1

Sign in or join free to run and submit your solution.