Bear and Poker

C. Bear and Poker

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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?

Input

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.

Output

Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise.

Sample test(s)

input

475 150 75 50

output

Yes

input

3100 150 250

output

No

Note

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.

思路：

   这题想了很久也没想出来，原来乘2和乘3能变同一个数，有除2和除3是否都为同一个数的逆推定理。。。

AC代码：

#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cstdio>#include<set>using namespace std;typedef __int64 ll;int main(){   /* freopen("input.txt","r",stdin);*/    int n,k;    while(~scanf("%d",&n))    {        set<int> a;        while(n--)        {            scanf("%d",&k);            while(k%2==0)k/=2;            while(k%3==0)k/=3;            a.insert(k);        }        if(a.size()==1)            printf("Yes\n");        else            printf("No\n");    }    return 0;}