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()
a=s.find("A")
b=s.rfind("Z")
print(b-a)
s=input()
a=s.find("A")
b=s.rfind("Z")
print(b-a+1)
