#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

using namespace std;

int dp[710][710],l[710][710],r[710][710],G[710][710],a[710];

inline int gcd(int a,int b){

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

}

int main(){

	int n;

	scanf("%d",&n);

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

		scanf("%d",&a[i]);

	}

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

		for(int j=1;j<=n;j++){

			if(gcd(a[i],a[j])>1)G[i][j]=1;

		}

	}

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

		l[i][i]=r[i][i]=1;

	for(int i=n;i>=1;i--){

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

			for(int k=i;k<=j;k++){

				if(l[i][k]&&r[k][j]){//如果k左端可以到i，右端可以到j

					dp[i][j]|=1;

					r[i-1][j]|=G[k][i-1];//向左延伸

					l[i][j+1]|=G[k][j+1];//向右延申

				}

			}

	}

	if(dp[1][n])printf("Yes\n");

	else printf("No\n");

}