#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  int n, i;
  cin >> n;
  map<int, int> mp;

  for (i=0; i<n; i++) {
    string s;
    cin >> s;

    int eyes=0;
    for (auto c:s) {
      if (c=='^') eyes++;
    }
    mp[eyes]+=1;
  }

  vector<vector<int>> v(mp.size(), vector<int>(2));
  i=0;
  for (auto itr=mp.begin(); itr!=mp.end(); itr++) {
    v[i][0]=itr->second, v[i++][1]=itr->first;
  }

  sort(v.begin(), v.end(), greater<vector<int>>());

  cout << v[0][1] << endl;
}