#include <iostream>
#include <vector>
#include <string.h>

using namespace std;

bool isContain(vector<int> v,int n) {
    bool flag = false;
    for (int i = 0; i < (int)v.size(); i++) {
        if (n == v[i]) {
            flag = true;
        }
    }
    return flag;
}

int main() {
    int hash[51];
    vector<int> inNum;
    memset(hash, 0, sizeof(hash));
    for (int i = 0; i < 50; i++) {
        int in;
        cin >> in;
        ++hash[in];
        if (!isContain(inNum, in)) {
            inNum.push_back(in);
        }
    }
    int minn = -1;
    for (int i = 0; i < (int)inNum.size(); i++) {
        if (hash[inNum[i]] > minn) {
            minn = hash[inNum[i]];
        }
    }
    cout << minn;
    return 0;
}