#include <bits/stdc++.h>
using namespace std;
vector<string> ss;
vector<int> x;
int sum = 0, warn = 0;
bool avaliable(string s) {
for (int i = 0; i < (int)ss.size(); ++i)
if (s == ss[i])
return true;
return false;
}
int finde(string s) {
for (int i = 0; i < (int)ss.size(); ++i)
if (s == ss[i])
return i;
}
int main()
{
int n, indx;
string s;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s;
if (!avaliable(s)) {
ss.push_back(s);
x.push_back(1);
++sum;
} else {
indx = finde(s);
if (x[indx] > sum - x[indx])
++warn;
++x[indx], ++sum;
}
}
cout << warn;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdmVjdG9yPHN0cmluZz4gc3M7CnZlY3RvcjxpbnQ+IHg7CmludCBzdW0gPSAwLCB3YXJuID0gMDsKCmJvb2wgYXZhbGlhYmxlKHN0cmluZyBzKSB7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IChpbnQpc3Muc2l6ZSgpOyArK2kpCiAgICAgICAgaWYgKHMgPT0gc3NbaV0pCiAgICAgICAgICAgIHJldHVybiB0cnVlOwogICAgcmV0dXJuIGZhbHNlOwp9CgppbnQgZmluZGUoc3RyaW5nIHMpIHsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgKGludClzcy5zaXplKCk7ICsraSkKICAgICAgICBpZiAocyA9PSBzc1tpXSkKICAgICAgICAgICAgcmV0dXJuIGk7Cn0KCmludCBtYWluKCkKewogICAgaW50IG4sIGluZHg7CiAgICBzdHJpbmcgczsKICAgIGNpbiA+PiBuOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyArK2kpIHsKICAgICAgICBjaW4gPj4gczsKICAgICAgICBpZiAoIWF2YWxpYWJsZShzKSkgewogICAgICAgICAgICBzcy5wdXNoX2JhY2socyk7CiAgICAgICAgICAgIHgucHVzaF9iYWNrKDEpOwogICAgICAgICAgICArK3N1bTsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBpbmR4ID0gZmluZGUocyk7CiAgICAgICAgICAgIGlmICh4W2luZHhdID4gc3VtIC0geFtpbmR4XSkKICAgICAgICAgICAgICAgICsrd2FybjsKICAgICAgICAgICAgKyt4W2luZHhdLCArK3N1bTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCB3YXJuOwoKICAgIHJldHVybiAwOwp9Cg==