题库练习 Bear and Poker
← 上一题 下一题 →

A10041 | Bear and Poker

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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 $a_{i}$ 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<=10^{5}$ ), the number of players.

The second line contains $n$ integer numbers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{9}$ ) — the bids of players.

输出格式

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

输入输出样例

输入 #1
4
75 150 75 50
输出 #1
Yes
输入 #2
3
100 150 250
输出 #2
No
C++ 编辑器
输入
输出