Cut Ribbon

#codeforces #math #array #bruteforce

Problem Link :- [https://codeforces.com/problemset/problem/189/A]

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

Input

7 5 5 2

Output

Hint:-

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.

Solution:-

To run the code Click here

import java.util.*;

public class Main
{
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
    int n = sc.nextInt ();
    int a = sc.nextInt ();
    int b = sc.nextInt ();
    int c = sc.nextInt ();
    int count = 0;
    int arr[] = { a, b, c };
    Arrays.sort (arr);

if (arr[0] >= n)
      {
 System.exit (0);
      }
    else
      {
 for (int i = 0; i < 2; i++)
   {

     if(n > 0)
       {
  n = n - arr[i];
  count++;
       }
   }
   System.out.println(count);
      }
  }
}