Problem:
Score : 200 points

Problem Statement

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.

Constraints

1 ≦ |s| ≦ 200{,}000

s consists of uppercase English letters.

There exists a substring of s that starts with A and ends with Z.

Input

The input is given from Standard Input in the following format:

s

Output

Print the answer.

Sample Input 1

QWERTYASDFZXCV

Sample Output 1

5

By taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.

Sample Input 2

ZABCZ

Sample Output 2

4

Sample Input 3

HASFJGHOGAKZZFEGA

Sample Output 3

12

Solution in Fortran (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program prob1
    implicit none
    integer :: n
    integer :: a, b
    integer :: i
    character(200005) :: s
    read(*,*) s
    n = len_trim(s)
    do i = 1, n
        if(s(i:i) == 'A') then
            a = i
        end if
        if(s(n-i+1:n-i+1) == 'Z') then
            b = n-i+1
        end if
    end do
    write(*,*) b-a+1


    stop
contains
end program prob1