A. Phone Numbers

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.

For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.

You have nn cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.

Input

The first line contains an integer nn — the number of cards with digits that you have (1≤n≤1001≤n≤100).

The second line contains a string of nn digits (characters "0", "1", ..., "9") s1,s2,…,sns1,s2,…,sn. The string will not contain any other characters, such as leading or trailing spaces.

Output

If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.

Examples

input

Copy

11
00000000008

output

Copy

1

input

Copy

22
0011223344556677889988

output

Copy

2

input

Copy

11
31415926535

output

Copy

0

Note

In the first example, one phone number, "8000000000", can be made from these cards.

In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".

In the third example you can't make any phone number from the given cards.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    while(cin>>n){
        char a[110];
        int cnt=0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            if(a[i]=='8') cnt++;
        }
        cout<<min(n/11,cnt)<<endl;
    }
}