Lilah has a string,
s, of lowercase English letters that she repeated infinitely many times.
Given an integer,
n, find and print the number of letter
a‘s in the first letters of Lilah’s infinite string.
The first line contains a single string,
The second line contains an integer,
25%of the test cases,
n <= 10^6
Print a single integer denoting the number of letter a’s in the first letters of the infinite string created by repeating infinitely many times.
Sample Input 0
Sample Output 0
n = 10 letters of the infinite string are
abaabaabaa. Because there are 7
a‘s, we print on a new line.
Sample Input 1
Sample Output 1
Because all of the first
n=1000000000000 letters of the infinite string are a, we print 1000000000000 on a new line.