#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
// kくんは全て勝つ
// それ以外は勝ち数が少ないチームが勝つ
int main(){
  int N;
  cin >> N;
  vector<string> vs;
  FOR(i,0,N){
    string s;
    cin >> s;
    vs.push_back(s);
  }
  int win[N];
  FOR(i,0,N){
    win[i] = 0;
  }
  FOR(i,0,N){
    FOR(j,0,N){
      if(vs[i][j]=='o'){
        win[i]++;
      }
      else if(i == 0 && vs[i][j] == '-'){
        vs[i][j] = 'o';
        vs[j][i] = 'x';
        win[i]++;
      }
      else if(vs[i][j] == '-'){
        if(win[i] < win[j]){
          vs[i][j] = 'o';
          vs[j][i] = 'x';
          win[i]++;
        } else {
          vs[i][j] = 'x';
          vs[j][i] = 'o';
          win[j]++;
        }
      }
    }
  }
  int ans = 1;
  FOR(i,1,N){
    if(win[0]<win[i]) ans++;
  }
  cout << ans << endl;
  return 0;
}