New Year Permutation

User ainta has a permutation p1, p2, ..., pn. As the New Year is coming, he wants to make his permutation as pretty as possible.

Permutation a1, a2, ..., an is prettier than permutation b1, b2, ..., bn, if and only if there exists an integer k (1 ≤ k ≤ n) where a1 = b1, a2 = b2, ..., ak - 1 = bk - 1 and ak < bk all holds.

As known, permutation p is so sensitive that it could be only modified by swapping two distinct elements. But swapping two elements is harder than you think. Given an n × n binary matrix A, user ainta can swap the values of pi and pj (1 ≤ i, j ≤ n, i ≠ j) if and only if Ai, j = 1.

Given the permutation p and the matrix A, user ainta wants to know the prettiest permutation that he can obtain.

Input

The first line contains an integer n (1 ≤ n ≤ 300) — the size of the permutation p.

The second line contains n space-separated integers p1, p2, ..., pn — the permutation p that user ainta has. Each integer between 1 and n occurs exactly once in the given permutation.

Next n lines describe the matrix A. The i-th line contains n characters '0' or '1' and describes the i-th row of A. The j-th character of the i-th line Ai, j is the element on the intersection of the i-th row and the j-th column of A. It is guaranteed that, for all integers i, j where 1 ≤ i < j ≤ n, Ai, j = Aj, i holds. Also, for all integers i where 1 ≤ i ≤ n, Ai, i = 0 holds.

Output

In the first and only line, print n space-separated integers, describing the prettiest permutation that can be obtained.

Examples

input

Copy

7
5 2 4 3 6 7 1
0001001
0000000
0000010
1000001
0000000
0010000
1001000

output

Copy

1 2 4 3 6 7 5

input

Copy

5
4 2 1 5 3
00100
00011
10010
01101
01010

output

Copy

1 2 3 4 5

自己模拟一遍就会发现，其实就是想经过交换后，能够得到一个尽量递增的序列。

可以先用并查集，给可以交换的位置进行分组。

之后把每个组合中的元素排列。

然后从头遍历位置，当前位置对应一个集合，输出当前集合中未被输出的最小元素。

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i <= b;++i)
using namespace std;

const int N = 310;
int n;
int p[N],a[N],idx[N];
vector<int> v[N];

int find(int x){
    if(p[x]==x) return x;
    else return p[x] = find(p[x]);
}

int main(){
	cin >> n;
	rep(i,1,n) cin >> a[i];
	rep(i,1,n) p[i] = i;
	rep(i,1,n){
        rep(j,1,n){
            char x; cin >> x;
            // 并查集维护的是可交换的位置，而不是值。
            if(i>j&&x == '1') p[find(i)] = find(j);
        }
	}
	rep(i,1,n) v[find(i)].push_back(a[i]);
	rep(i,1,n) if(p[i]==i) sort(v[i].begin(),v[i].end());
	for(int i = 1; i <= n; i++) {
		int f = find(i);
		// 找到属于一个可交换集合，输出最小值。
        cout << v[f][idx[f]] << ' ';
        idx[f]++;
	}
	return 0;
}