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

//qscqesze

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <bitset>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

#include <fstream>

#include <map>

#include <stack>

typedef long long ll;

using namespace std;

//freopen("D.in","r",stdin);

//freopen("D.out","w",stdout);

#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)

#define maxn 200051

#define mod 10007

#define eps 1e-9

int Num;

//const int inf=0x7fffffff;   //нчоч╢С

const int inf=0x3f3f3f3f;

inline ll read()

{

    ll x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

//**************************************************************************************

ll a[maxn];

int check(ll x)

{

    if(x==)

        return ;

    if(x==)

        return ;

    if(x==)

        return ;

    if(x%==)

        return check(x/);

    if(x%==)

        return check(x/);

    return ;

}

int n;

ll gcd(ll a,ll b)

{

    return b==?a:gcd(b,a%b);

}

ll lcm(ll a,ll b)

{

    return a*b/gcd(a,b);

}

int main()

{

    n=read();

    for(int i=;i<n;i++)

        a[i]=read();

    sort(a,a+n);

    ll tmp = a[];

    for(int i=;i<n;i++)

    {

        tmp = gcd(tmp,a[i]);

    }

    for(int i=;i<n;i++)

    {

        if(!check(a[i]/tmp))

        {

            cout<<"No"<<endl;

            return ;

        }

    }

        cout<<"Yes"<<endl;

}