#include <cstdio>
#include <vector>
#include <functional>
#include <numeric>
#include <algorithm>
using namespace std;
const int N = 1000 + 10;
int n, p[N], s;
/*bool Shoubu(vector<int> a, vector<int> b) {
    int s = accumulate(a.begin(), a.end(), 0);
    int t = accumulate(b.begin(), b.end(), 0);
    if(s > 21) { return;
    if(t > 21)
}
void DFS(vector<int> a, vector<int> b, int c, int k) {
    if(Shoubu(a, b)) {
        if(n - c < 6) return;
        a.clear(); b.clear();
        for(int i=1; i<4; i++) DFS(a, b, c, i);
    } else {
        if(k == 1) {        // OX
            if(accumulate(a.begin(), a.end(), 0) > 16) return;
        } else if(k == 2) { // XO
        } else if(k == 3) { // OO
        }
    }
}*/
// 我永远也写不出来搜索了 %>_<%
int main() {
    freopen("jack.in", "r", stdin);
    freopen("jack.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        scanf("%d", p+i);
    /*vector<int> a, b;
    a.push_back(p[1]); b.push_back(p[2]);
    a.push_back(p[3]); b.push_back(p[4]);
    for(int i=1; i<4; i++) DFS(a, b, 5, i);*/
    s = n / 7;
    printf("%d\n", s);
    return 0;
}