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`.
s=input()

Aindex = s.find("A")
Zindex = -1

for index,character in enumerate(s[Aindex:]):
    if character == "Z":
        Zindex = index

print(s[Aindex:Zindex+1])
s=input()
Aindex = s.find("A")
Zindex = -1
for index,character in enumerate(s[Aindex:]):
    if character == "Z":
        Zindex = index + Aindex
print(len(s[Aindex:Zindex+1]))