#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N * N);
for (int i = 0; i < N * N; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
int maxCount = 0;
int currentCount = 0;
int currentNum = arr[0];
for (int i = 0; i < N * N; i++) {
if (arr[i] == currentNum) {
currentCount++;
} else {
maxCount = max(maxCount, currentCount);
currentCount = 1;
currentNum = arr[i];
}
}
maxCount = max(maxCount, currentCount);
cout << maxCount << endl;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAppbnQgbWFpbigpIHsKICAgIGludCBOOwogICAgY2luID4+IE47CiAKICAgIHZlY3RvcjxpbnQ+IGFycihOICogTik7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IE4gKiBOOyBpKyspIHsKICAgICAgICBjaW4gPj4gYXJyW2ldOwogICAgfQogCiAgICBzb3J0KGFyci5iZWdpbigpLCBhcnIuZW5kKCkpOwogCiAgICBpbnQgbWF4Q291bnQgPSAwOwogICAgaW50IGN1cnJlbnRDb3VudCA9IDA7CiAgICBpbnQgY3VycmVudE51bSA9IGFyclswXTsKIAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBOICogTjsgaSsrKSB7CiAgICAgICAgaWYgKGFycltpXSA9PSBjdXJyZW50TnVtKSB7CiAgICAgICAgICAgIGN1cnJlbnRDb3VudCsrOwogICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgIG1heENvdW50ID0gbWF4KG1heENvdW50LCBjdXJyZW50Q291bnQpOwogICAgICAgICAgICBjdXJyZW50Q291bnQgPSAxOwogICAgICAgICAgICBjdXJyZW50TnVtID0gYXJyW2ldOwogICAgICAgIH0KICAgIH0KIAogICAgbWF4Q291bnQgPSBtYXgobWF4Q291bnQsIGN1cnJlbnRDb3VudCk7CiAKICAgIGNvdXQgPDwgbWF4Q291bnQgPDwgZW5kbDsKIAogICAgcmV0dXJuIDA7Cn0=