Closing Holes(Easy)

1

1 votes
Easy
Problem

Given a string consist of uppercase latin words and you need to report no.of holes in the given string use the following table

A-1
B-2
C-0
D-1
E-0
F-0
G-0
H-0
I- 0
J -0
K-0
L-0
M-0
N-0
O-1
P-1
Q-1
R-1
S-0
T-0
U-0
V-0
W-0
X-0
Y-0
Z-0

Input:
The first and only line of input contains the String S. The String shall consist of lowercase English alphabets only.

Ouput:
Print no of holes present in given string in a single line


Constraints
1≤|S|≤100

Sample Input1:
RIA
Sample Output1:
2

Sample Input
RIA
Sample Output
2
Time Limit: 4
Memory Limit: 256
Source Limit:
Contributers:
Editor Image

?