#include <limits>
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<int> v(7);
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        v[k]++;
    }
    cout << 6 - std::distance(v.rbegin(), max_element(v.rbegin(), v.rend())) << "\n";
    return 0;
}