#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    unordered_map<int32_t, int32_t> hist;
    for (auto i = 0; i < n; ++i) {
        string s;
        cin >> s;
        int32_t cnt = 0;
        for (auto c : s) {
            if (c == '^')
                ++cnt;
        }
        ++hist[cnt];
    }
    vector<pair<int32_t, int32_t>> xs;
    for (auto &&p : hist) {
        xs.push_back({p.second, p.first});
    }
    sort(xs.rbegin(), xs.rend());
    cout << xs[0].second << endl;
    return 0;
}