Score : 200 points
Snuke has decided to construct a string that starts with A
and ends with Z
, by taking out a substring of a string s (that is, a consecutive part of s).
Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A
and ends with Z
.
A
and ends with Z
.The input is given from Standard Input in the following format:
s
Print the answer.
QWERTYASDFZXCV
5
By taking out the seventh through eleventh characters, it is possible to construct ASDFZ
, which starts with A
and ends with Z
.
ZABCZ
4
HASFJGHOGAKZZFEGA
12