10041: ABC339 —— A - TLD
[Creator : ]
Description
You are given a string $S$ consisting of lowercase English letters and the character `.`.
Print the last substring when $S$ is split by `.`s.
In other words, print the longest suffix of $S$ that does not contain `.`.
Print the last substring when $S$ is split by `.`s.
In other words, print the longest suffix of $S$ that does not contain `.`.
Input
The input is given from Standard Input in the following format:
```
$S$
```
```
$S$
```
Output
Print the answer.
Constraints
- $S$ is a string of length between $2$ and $100$, inclusive, consisting of lowercase English letters and `.`.
- $S$ contains at least one `.`.
- $S$ does not end with `.`.
- $S$ contains at least one `.`.
- $S$ does not end with `.`.
Sample 1 Input
atcoder.jp
Sample 1 Output
jp
The longest suffix of atcoder.jp that does not contain . is jp.
Sample 2 Input
translate.google.com
Sample 2 Output
com
S may contain multiple .s.
Sample 3 Input
.z
Sample 3 Output
z
S may start with ..
..........txt
txt
S may contain consecutive .s.