Codeforces Round #358 (Div. 2)

Codeforces Round #358 (Div. 2)

A. Alyona and Numbers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers — the first column containing integers from 1 to n and the second containing integers from 1 to m. Now the girl wants to count how many pairs of integers she can choose, one from the first column and the other from the second column, such that their sum is divisible by 5.

Formally, Alyona wants to count the number of pairs of integers (x, y) such that 1 ≤ x ≤ n, 1 ≤ y ≤ m and  equals 0.

As usual, Alyona has some troubles and asks you to help.

Input

The only line of the input contains two integers n and m (1 ≤ n, m ≤ 1 000 000).

Output

Print the only integer — the number of pairs of integers (x, y) such that 1 ≤ x ≤ n, 1 ≤ y ≤ m and (x + y) is divisible by 5.

Examples

input

6 12

output

14

input

11 14

output

31

input

1 5

output

1

input

3 8

output

5

input

5 7

output

7

input

21 21

output

88

Note

Following pairs are suitable in the first sample case:

• for x = 1 fits y equal to 4 or 9;
• for x = 2 fits y equal to 3 or 8;
• for x = 3 fits y equal to 2, 7 or 12;
• for x = 4 fits y equal to 1, 6 or 11;
• for x = 5 fits y equal to 5 or 10;
• for x = 6 fits y equal to 4 or 9.

Only the pair (1, 4) is suitable in the third sample case.

简单数学，从两个集合中各挑一个数，找可以凑成5的倍数的组合

#include <iostream>

using namespace std;

int main()
{
    long long n,m;
    while(cin>>n>>m){
        long long a[6]={0},b[6]={0};
        for(int i=1;i<=5;i++){
            if(n-i>=0)
            a[i]=(n-i)/5+1;
            if(m-i>=0)
            b[i]=(m-i)/5+1;
        }
        long long ans=a[5]*b[5];
        for(int i=1;i<=4;i++)
            ans+=a[i]*b[5-i];
        cout<<ans<<endl;
    }
}

B. Alyona and Mex

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular, she may not apply any operation to the array at all.

Formally, after applying some operations Alyona will get an array of n positive integers b1, b2, ..., bn such that 1 ≤ bi ≤ ai for every1 ≤ i ≤ n. Your task is to determine the maximum possible value of mex of this array.

Mex of an array in this problem is the minimum positive integer that doesn't appear in this array. For example, mex of the array containing 1, 3 and 4 is equal to 2, while mex of the array containing 2, 3 and 2 is equal to 1.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of elements in the Alyona's array.

The second line of the input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations.

Examples

input

5
1 3 3 3 6

output

5

input

2
2 1

output

3

Note

In the first sample case if one will decrease the second element value to 2 and the fifth element value to 4 then the mex value of resulting array 1 2 3 3 4 will be equal to 5.

To reach the answer to the second sample case one must not decrease any of the array elements.

按1，2，3.......排下去排到最后一个即可

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    long long n,pri;
    while(cin>>n){
        long long a[100005];
        for(int i=1;i<=n;i++)
            cin>>a[i];
        sort(a+1,a+1+n);
        pri=1;
        for(int i=1;i<=n;i++){
            if(a[i]>=pri)   pri++;
        }
        cout<<pri<<endl;
    }
}