Derek loves to eat dim sum, but it is always a hassle to figure out how much he is going to pay. Given a list of the prices of dishes he ordered, help Derek figure out the sum of all the dim sum dishes!
Derek also loves giving you unreasonable constraints, so he asks that your solution cannot contain any alphanumeric characters or quotation marks.
The first line of input will contain one integer \(N\), the number of dishes to follow.
The next \(N\) lines will each contain one integer \(P\), the price of that dish.
Print out one integer \(S\), the total sum of all the prices.
\(1 \le N \le 3000\)
\(0 \le P \le 100\)
4 2 3 5 3