BETA
This is a school problem. Successful submissions of this are not counted in user ratings.

Submissions : 2147 Accuracy :

35.86

Count Alphabets
     

Given a string, print the number of alphabets present in the string.

Input:

The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.Each test case contains a single string. 


Output:

Print the number of alphabets present in the string.

Constraints:

1<=T<=30

1<=size of string <=100


Example:

Input:

2
adjfjh23
njnfn_+-jf

Output:

6
7

**For More Examples Use Expected Output**


Set Default Code

					   
Result:
It is recommended to test your code before clicking 'Submit' button!



                   



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.