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 C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
int main(void)
{
	char s[200001];
	long long int i,j;
	long long int num;
	long long int max = 0;
	scanf("%s", s);
	for (i = 0; s[i] != '\0'; i++)
	{
		if (s[i] == 'A')
		{
			num = 0;
			for (i=i;s[i] != '\0'; i++)
			{
				num++;
				if (num > max) max = num;
				if (s[i] == 'Z'&&s[i+1]!='Z') break;
			}
		}
	}
	printf("%lld\n", max);
	return 0;
}