#include <bits/stdc++.h>
using namespace std;
#define ll long long
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1};
int dy2[] = {0, 0, 1, -1, 1, 1, -1, -1};
int knightX[] = {-2, -2, 2, 2, 1, 1, -1, -1};
int knightY[] = {-1, 1, -1, 1, -2, 2, -2, 2};
const ll INF = 0x3f3f3f3f;
const int N = 1e5, K = 105;
const ll MOD = 1e9 + 7;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
vector<vector<ll>> dp(n+1, vector<ll>(N + 1, 0));
for(auto &i : v){
for(int j = n; j >= 1; j--){
if(j == 1){
dp[1][i]++;
}
else{
for(int k = 1; k <= N; k++){
if(dp[j - 1][k] > 0){
dp[j][gcd(k, i)] += dp[j - 1][k];
}
}
}
}
}
for(int i = 1; i <= n; i++){
int ans = 1;
for(int j = N; j >=1; j--){
if(dp[i][j] > 0){
ans = j;
break;
}
}
cout << ans << (i == n ? '\n' : ' ');
}
}
return 0;
}