Stop at the First Period

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Read exactly one printable ASCII line containing at least one period (.). Count English letters A-Z and a-z strictly before the first period. Do not count spaces, digits or other punctuation; ignore all characters after the first period.

Input

One line of 1 to 100000 printable ASCII characters (codes 32–126), excluding the newline. At least one period is present. Leading/trailing spaces are allowed.

Output

Print the count of English letters preceding the first period.

Subtasks

• Subtask 1 (20%): Line length at most 10, including at least one period.

• Subtask 2 (30%): Line length at most 100, including at least one period.

• Subtask 3 (50%): Line length at most 100000, including at least one period.

Examples

Example 1

Input:

A1 b!?Cd.xyz

Output:

4

Explanation:

Count ASCII letters before the first period, ignoring the suffix.

Example 2

Input:

.abc

Output:

0

Explanation:

Count ASCII letters before the first period, ignoring the suffix.