Cut Ribbon

Cut Ribbon

Problem

Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:

• After the cutting each ribbon piece should have length a, b or c.
• After the cutting the number of ribbon pieces should be maximum.

Help Polycarpus and find the number of ribbon pieces after the required cutting.

Input

The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.

Output

Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.

Examples

Input

5 5 3 2

Output

2

Input

7 5 5 2

Output

2

Note

In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.

In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll inf=0x3f3f3f3f;
const ll N=4e3+10;
ll dp[N];

int main()
{
    ll n,a[3];
    cin>>n>>a[0]>>a[1]>>a[2];
    memset(dp,-inf,sizeof dp);

    //给出一条丝带长度n,要求把丝带切成给定长度a,b,c中的一种或多种
    //最多能切成几条（保证至少有一个解）（完全背包）
    dp[0]=0;
    for(ll i=0;i<3;i++)
        for(ll j=a[i];j<=n;j++)
            dp[j]=max(dp[j],dp[j-a[i]]+1);
    
    cout<<dp[n]<<endl;
    return 0;
}