Shopping at the Mall

Problem Description

Xiaoming is a rather unplanned child. No sooner did he get his pocket money than he took it all to the mall.

Xiaoming's rule is simple: whenever he comes across an item he wants to buy, as long as he can afford it, he buys it and only then moves on; if he cannot afford it, he simply skips it.

After a day of shopping, how many items did Xiaoming actually buy?

Input Format

The input consists of $3$ lines:

The $1$st line is an integer $N$, the number of items Xiaoming wants to buy in the mall ($1 \le N \le 100$);

The $2$nd line contains $N$ integers, the prices of the items Xiaoming encounters in order;

The $3$rd line is an integer $X$, the amount of pocket money Xiaoming starts with, in yuan.

Output Format

Output $1$ line containing one integer: the number of items Xiaoming bought.

Sample Input

6
7 5 9 10 7 4
30

Sample Output

4

Sample Explanation

Xiaoming starts with $30$ yuan. The prices he encounters in order are $7$, $5$, $9$, $10$, $7$, $4$.

• He sees the $7$-yuan item, can afford it, and after buying has $30-7=23$ yuan left;
• He sees the $5$-yuan item, and after buying has $23-5=18$ yuan left;
• He sees the $9$-yuan item, and after buying has $18-9=9$ yuan left;
• He sees the $10$-yuan item, but $9 < 10$, so he cannot afford it and skips it;
• He sees the $7$-yuan item, and after buying has $9-7=2$ yuan left;
• He sees the $4$-yuan item, but $2 < 4$, so he cannot afford it and skips it.

In the end Xiaoming bought $4$ items in total, so the output is $4$.

Constraints

• $1 \le N \le 100$
• $0 \le a_i \le 10^5$ (item prices)
• $X$ is a non-negative integer; its range is not explicitly restricted, but the input is guaranteed to be valid.