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 (GCC 5.4.1) (judge verdict: Accepted)

/*
  B - A to Z String
  <http://abc053.contest.atcoder.jp/tasks/abc053_b>
*/

#include <stdio.h>
#include <string.h>

int main(int argc, char const *argv[]) {

  char s[200001];
  int len, end, start;
  int i;

  scanf("%s", s);
  len = strlen(s);

  i = 0;
  while( i < len ){
    if ( s[i] == 'A' ) {
      start = i;
      break;
    }
    i++;
  }

  i = len - 1;
  while( i >= 0 ){
    if( s[i] == 'Z' ){
      end = i;
      break;
    }
    i--;
  }

  printf("%d\n", end - (start-1) );

  return 0;
}