#### Registered Users Only

Please login to view and utilize this feature.

## Problem Description

Ranald the cat is reading his Geography notes and he got bored. He takes his highlighter and decides to highlight letters, in alphabetical order, A to Z.

One example is: __Ab__solute __c__at __d__o__e__s __f__ishin__g__, __hi__ll __j__ac__k__ __l__a__m__e __nop__e __q__uick __r__e__st__ yo__u__ __v__ista __w__hile fa__x__ __y__ou __z__ebra.

## Task Description

Given the paragraph (with spaces and punctuations) on a single line, output the total number of different ways Ranald can highlight the letters from A to Z.

## Input

The answer will be able to fit into a 64-bit unsigned integer.

For 50% of the testcases, the length of the string will be not more than 1000.

For 75% of the testcases, the length of the string will be not more than 40000.

For 100% of the testcases, the length of the string will not be more than 1000000.

## Output

Output a single integer, which denotes the number of different ways Ranald can highlight the letters from A to Z.

## Sample Input 1

abcdefgHiJklmnoPqRstUvwxYz

## Sample Output 1

1

## Sample Input 2

ababcdefghijklmnopqrstuvwxyz

## Sample Output 2

3

## Explanation for Sample Output 2

__ab__ab

__cdefghijklmnopqrstuvwxyz__

__a__ba

__bcdefghijklmnopqrstuvwxyz__

ab

__abcdefghijklmnopqrstuvwxyz__

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 0 | 2 | 1s | 32MB | Average |

2 | 100 | 4 | 1s | 32MB | Average |

### Judge Compile Command

g++ ans.cpp -o letters -Wall -static -O2 -lm -m64 -s -w -std=gnu++14 -fmax-errors=512