#include <iostream>
using namespace std;
int main()
{
int n, pairs = 0;
cin >> n;
int sock[n];
for(int i = 0; i < n; i++)
cin >> sock[i];
for(int i = 0; i < n-1; ++i)
{ //selection sort
for(int j = i+1; j < n; ++j)
{
if(sock[i] > sock[j])
{
int tmp = sock[j];
sock[j] = sock[i];
sock[i] = tmp;
}
}
}
//23466
for(int i = 0; i < n-1; ++i) //number of pairs
{ cout<< "sock["<<i<<"] ="<< sock[i]<<" ,sock["<<i<<"+1] ="<<sock[i+1]<<endl;
if(sock[i] == sock[i+1])
{
pairs++;
}
i++;
}
cout << pairs << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQp7CiAgIGludCBuLCBwYWlycyA9IDA7CiAgICBjaW4gPj4gbjsKICAgIGludCBzb2NrW25dOwogICAgZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgICAgIGNpbiA+PiBzb2NrW2ldOwogICAgCiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbi0xOyArK2kpCiAgICB7IC8vc2VsZWN0aW9uIHNvcnQKICAgICAgICBmb3IoaW50IGogPSBpKzE7IGogPCBuOyArK2opCiAgICAgICAgewogICAgICAgICAgICBpZihzb2NrW2ldID4gc29ja1tqXSkKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgaW50IHRtcCA9IHNvY2tbal07CiAgICAgICAgICAgICAgICBzb2NrW2pdID0gc29ja1tpXTsKICAgICAgICAgICAgICAgIHNvY2tbaV0gPSB0bXA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CiAgICAvLzIzNDY2CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbi0xOyArK2kpIC8vbnVtYmVyIG9mIHBhaXJzCiAgICB7ICBjb3V0PDwgInNvY2tbIjw8aTw8Il0gPSI8PCBzb2NrW2ldPDwiICAsc29ja1siPDxpPDwiKzFdID0iPDxzb2NrW2krMV08PGVuZGw7CiAgICAgICAgaWYoc29ja1tpXSA9PSBzb2NrW2krMV0pIAogICAgICAgIHsKICAgICAgICAgICAgcGFpcnMrKzsKICAgICAgICB9CiAgICAgICAgaSsrOwogICAgfQogICAgY291dCA8PCBwYWlycyA8PCBlbmRsOwogICAgcmV0dXJuIDA7Cn0=