Codeforces Beta Round 86 (Div. 2 Only)
A
Cifera
Codeforces
1000
原题
←B →
翻译中…

When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.

翻译中…

Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number $*k*$. Moreover, petricium la petricium stands for number $*k*^{2}$, petricium la petricium la petricium stands for $*k*^{3}$ and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.

翻译中…

Petya's invention brought on a challenge that needed to be solved quickly: does some number $*l*$ belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.

翻译中…

Input

翻译中…

The first input line contains integer number $*k*$, the second line contains integer number $*l*$ ($2 ≤ *k*, *l* ≤ 2^{31} - 1$).

翻译中…

Output

翻译中…

You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number $*l*$.

翻译中…

样例

Input #1
5
25
Output #1
YES
1
InputCopy OutputCopy
Input #2
3
8
Output #2
NO
InputCopy OutputCopy
题目信息
题号
114A
时间限制
2 s
内存限制
256 MB
标签
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。