#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  cin >> n;
  vector<string> v(n);
  rep(i, 0, n) cin >> v[i];

  int win = 0;
  rep(i, 1, n) {
    if (v[0][i] == '-') {
      v[0][i] = 'o';
      v[i][0] = 'x';
    }
    if (v[0][i] == 'o')
      win++;
  }

  vector<P> wins;
  wins.emplace_back(win, 0);
  int fin = 1;
  rep(i, 1, n) {
    int w = 0, rem = 0;
    rep(j, 0, n) {
      if (i == j)
        continue;
      if (v[i][j] == 'o')
        w++;
      else if (v[i][j] == '-')
        rem++;
    }
    if (rem == 0)
      fin++;
    wins.emplace_back(w, rem);
  }

  while (fin < n) {
    rep(i, 1, n) {
      if (wins[i].second == 0)
        continue;

      int x = wins[i].first + wins[i].second;
      if (x <= win || wins[i].first > win) {
        rep(j, 0, n) {
          if (v[i][j] == '-') {
            v[i][j] = 'o';
            v[j][i] = 'x';
            wins[i].first++;
            wins[j].second--;
            if (wins[j].second == 0)
              fin++;
          }
        }
        fin++;
      }
    }
  }

  int ans = 1;
  rep(i, 1, n) {
    if (wins[i].first > win)
      ans++;
  }

  cout << ans << endl;
}