#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<stack>
#include<queue>

using namespace std;

typedef long long i64;
#define put(n) cout<<(n)<<"\n"
#define FOR(i,num,N) for(int(i)=(num);(i)<(N);(i)++)
#define RFOR(i,num,N) for(int (i)=(num);(i)>(N);(i)--)
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() , (v).rend()

int main(){

    int N;
    cin>>N;

    vector<string> monster(N);
    FOR(i,0,N) cin>>monster[i];

    map<int,int> mp;
    FOR(i,0,1001) mp[i] = 0;

    FOR(i,0,N){
        int count = 0;
        FOR(j,0,monster[i].size()){
            string s = monster[i];
            if(s[j] == '^') count++;
        }
        mp[count]++;
    }


    int ans;
    int max = -1e9;
    for(auto v : mp){
        if(max < v.second){
            max = v.second;
            ans = v.first;
        } 
        else if(max == v.second) ans = std::max(ans,v.first);
    }
    put(ans);
    
}