Problem9230--ABC291 —— A - camel Case

9230: ABC291 —— A - camel Case

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

### Problem Statement

You are given a string $S$ consisting of uppercase and lowercase English letters.  
Here, exactly one character of $S$ is uppercase, and the others are all lowercase.  
Find the integer $x$ such that the $x$-th character of $S$ is uppercase.  
Here, the initial character of $S$ is considered the $1$-st one.

Input

### Input

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

```
$S$
```

Output

### Output

Print the integer $x$ such that the $x$-th character of $S$ is uppercase.

Constraints

### Constraints

-   $S$ is a string of length between $2$ and $100$, inclusive, consisting of uppercase and lowercase English letters.
-   $S$ has exactly one uppercase letter.

Sample 1 Input

aBc

Sample 1 Output

2
The 1-st character of aBc is a, the 2-nd is B, and the 3-rd is c; the 2-nd character is uppercase.
Thus, 2 should be printed.

Sample 2 Input

xxxxxxXxxx

Sample 2 Output

7
An uppercase letter X occurs as the 7-th character of S=xxxxxxXxxx, so 7 should be printed.

Sample 3 Input

Zz

Sample 3 Output

1

Source/Category