CF573A.Bear and Poker

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?

Limak 是一只年迈的棕熊，他经常和朋友们一起玩扑克。今天，他们来到了一家赌场。赌场里共有 $n$ 名玩家（包括 Limak 自己），此时每位玩家在桌面上都已下注，第 $i$ 位玩家的下注额为 $a_i$ 美元。

每位玩家可以将自己的下注额任意次乘以 $2$，也可以任意次乘以 $3$。赌场为所有玩家下注额相等的情形设置了巨额大奖。Limak 和他的朋友们能否赢得这笔大奖？

First line of input contains an integer n (2 ≤ n ≤ 105), the number of players.

The second line contains n integer numbers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 109) — the bids of players.

输入的第一行包含一个整数 $n$（$2 \leq n \leq 10^5$），表示玩家的数量。

第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \leq a_i \leq 10^9$）—— 各玩家的出价。

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

如果玩家可以使他们的出价相等，则输出 "Yes"（不带引号），否则输出 "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.

在第一个样例测试中，第一位和第三位玩家应将其出价翻倍两次，第二位玩家应将其出价翻倍一次，第四位玩家应既将其出价翻倍又将其出价变为三倍。

可以证明，在第二个样例测试中，不存在使所有出价相等的方法。