把每个数除以总gcd,观察它们有无非2,3的因子
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100010)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int a[MAXN],n;
int gcd(int a,int b){if (b==0) return a;return gcd(b,a%b);}
int main()
{
// freopen("C.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
For(i,n)
scanf("%d",&a[i]);
int p=a[1];
Fork(i,2,n) p=gcd(p,a[i]);
For(i,n) a[i]/=p;
For(i,n)
{
while(a[i]%2==0) a[i]/=2;
while(a[i]%3==0) a[i]/=3;
if (a[i]^1) {
puts("No");return 0;
}
}
puts("Yes");
return 0;
}