#include<bits/stdc++.h>
using namespace std;
int i,j;
int main() {
  string s;
  cin>>s;
  for(i=0;s[i]!='A';i++);
  for(j=s.size();s[j]!='Z';j--);
  cout<<j-i+1;
  return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

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.

Examples

Input

QWERTYASDFZXCV


Output

5


Input

ZABCZ


Output

4


Input

HASFJGHOGAKZZFEGA


Output

12

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int i,j;
int main() {
  string s;
  cin>>s;
  for(i=0;s[i]!='A';i++);
  for(j=s.size();s[j]!='Z';j--);
  cout<<j-i+1;
  return 0;
}

```