Knapsack

Description:

Input:

The first line contains one integer $$$W$$$ ($$$0 \le W \le 10^{18}$$$) — the maximum total weight of a good subset.

The second line denotes the set of items you have. It contains $$$8$$$ integers $$$cnt_1$$$, $$$cnt_2$$$, ..., $$$cnt_8$$$ ($$$0 \le cnt_i \le 10^{16}$$$), where $$$cnt_i$$$ is the number of items having weight $$$i$$$ in the set.

Output:

Print one integer — the maximum possible weight of a good subset of items.

Sample Input:

10
1 2 3 4 5 6 7 8

Sample Output:

10

Sample Input:

0
0 0 0 0 0 0 0 0

Sample Output:

0

Sample Input:

3
0 4 1 0 0 9 8 3

Sample Output:

3