After little Jim learned Fibonacci Number in the class , he was very interest in it.
Now he is thinking about a new thing -- Fibonacci String .
He defines : str[n] = str[n-1] + str[n-2] ( n > 1 )
He is so crazying that if someone gives him two strings str and str, he will calculate the str,str,str , str....
For example :
If str = "ab"; str = "bc";
he will get the result , str="abbc", str="bcabbc" , str="abbcbcabbc" …………;
As the string is too long ,Jim can't write down all the strings in paper. So he just want to know how many times each letter appears in Kth Fibonacci String . Can you help him ?
The first line contains a integer N which indicat