#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) #define bit_count __builtin_popcount #define mt make_tuple typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum accumulate #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} vs S; vector vp; int len_vp = 0; int ans = 10, n; void f(int a) { if (a == len_vp) { vector v(n); rep(i, 0, n) { v[i] = mp(count(all(S[i]), 'o'), i); } sort(rall(v)); int num = 1, last = v[0].fi; rep(i, 1, n) { if (v[i].fi != last) { ++num; } if (v[i].se == 0) break; } chmin(ans, num); return; } S[vp[a].fi][vp[a].se] = 'o'; S[vp[a].se][vp[a].fi] = 'x'; f(a + 1); S[vp[a].fi][vp[a].se] = 'x'; S[vp[a].se][vp[a].fi] = 'o'; f(a + 1); } int main() { cin >> n; rep(i, 0, n) {string s; cin >> s; S.eb(s);} rep(i, 0, n) { rep(j, 1, n) { if (S[i][j] == '-') vp.eb(mp(i, j)); } } len_vp = len(vp); f(0); print(ans); return 0; }