Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on the table. i-th of them has bid with size ai dollars.
Each player can double his bid any number of times and triple his bid any number of times. The casino has a great jackpot for making all bids equal. Is it possible that Limak and his friends will win a jackpot?
First line of input contains an integer n (2 ≤ n ≤ 105), the number of players.
The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 109) — the bids of players.
Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise.
4 75 150 75 50
Yes
3 100 150 250
No
In the first sample test first and third players should double their bids twice, second player should double his bid once and fourth player should both double and triple his bid.
It can be shown that in the second sample test there is no way to make all bids equal.
题目大意：给出n个数，问是否可以把这些数分别乘以若干个2或3，使得它们相等。
根据唯一分解定理，一个数可以被写成这样的形式$x=p_1^{a_1}+p_2^{a_2}+...+p_k^{a_k}$（$p_i$为质数）。把一个数乘2或乘3只会改变2或3上的指数，不可能改变别的指数，所以只要所有给出的数除去质因数2和3后都相等，就可以通过乘2和乘3使它们相等。
代码在此。
评论 (0)
