The Polite WaiterEasy

The Polite Waiter

Easy+5 XP · +3 Aura (late, half)stringscountingloops

Rohan is a waiter at a popular cafe. He's always polite, and believes in offering a "Namaste" to every customer who walks in. Rohan has a special way of greeting customers. For every customer who enters, he checks their name. If their name contains the letter 'a' (lowercase), he says "Namaste!" twice. Otherwise, he says it only once.

Given a customer's name, help Rohan determine how many times he will say "Namaste!".

Input

A single line containing the customer's name, consisting of lowercase English letters.

Output

A single integer representing the total number of times Rohan says "Namaste!".

Constraints

The customer's name will have length between 1 and 1000, inclusive.

Time limit 1 s (native code; slower languages get more)Memory 256 MB14 hidden tests

Example 1

Input
rahul
Output
6

The name 'rahul' contains two 'a's. For each 'a', Rohan says 'Namaste!' twice (2*2=4). For 'r', 'h', 'u', 'l', he says 'Namaste!' once each (4*1=4). Total is 4+4=8.

Example 2

Input
hello
Output
5

The name 'hello' does not contain 'a'. Rohan says 'Namaste!' once for each character. There are 5 characters, so he says it 5 times.

Hints