# Finding An A

In this problem, you are given a single string $s$ that is guaranteed to contain the
letter `a`.

You should output the suffix of $s$ that begins with the first occurrence of the letter $a$. Namely, if $s$ consists of characters $s_1s_2\ldots s_ n$ and $i$ is the first index with $s_ i = \texttt{a}$, then you should output the string $s_ is_{i+1}\ldots s_ n$.

Why do you want to do this? To solve a problem in the contest!

## Input

Input consists of a single line containing a single string
$s$ whose length is
between $1$ and
$1\, 000$. The string is
composed of lowercase letters with no spaces. You are
guaranteed the letter `a` appears at
least once in $s$.

## Output

Output the suffix of $s$ that begins with the first
occurrence of the letter `a`.

Sample Input 1 | Sample Output 1 |
---|---|

banana |
anana |

Sample Input 2 | Sample Output 2 |
---|---|

polarbear |
arbear |

Sample Input 3 | Sample Output 3 |
---|---|

art |
art |