GLJIVE - GLJIVE

In front of Super Mario there are 10 mushrooms, arranged in a row. A certain amount of points is awarded for picking each of the mushrooms. Super Mario must pick mushrooms in order they appear, but is not required to pick them all – his goal is to score a number of points as close as possible to 100.

In case there exist two such numbers which are equally close to 100 (e.g. 98 and 102), Mario will pick the greater one (in this case 102).

Help Super Mario and tell him how many points he will score.

Input

Input consists of 10 lines, each of which contains one positive integer less than or equal to 100, denoting the scores awarded for picking each mushroom, in the order that Mario can pick them in.

Output

The first and only line of output must contain the required number of points.

Example

Input:
10
20
30
40
50
60
70
80
90
100

Output:
100

Added by:akaki
Date:2011-02-13
Time limit:0.205s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:coci

hide comments
2016-06-04 15:27:02
@Anand No, you cant skip elements. You HAVE TO take the sum from the first element onwards. I did the same "mistake", considered every combination and got a WA.
2016-05-26 19:00:13 Praneeth
check for equally close to 100 also
2016-05-24 09:55:20 Siddharth Singh
Costed Me 3 WA's (Test Case 10)
Abhigupta4's comment helped
just exit program using return 0 when sum >=100
and mind u , its not a sliding window question.
2016-05-16 19:39:13
@Anand 55+34+8+2+1=100
2016-04-26 07:08:09 Christian López
My 30, AC in one go.
2016-03-24 20:46:01
Ans i was doing subset sum :3
2016-03-21 15:18:44 utkarsh538
Easy problem..think properly :)
2016-01-23 07:59:15
Dont underastimate it :/ ... 1WA just because = sign
2015-12-18 19:16:57
Easy one....but underestimating it costed me 1 WA
2015-11-29 04:55:08
no use EOF..simply a loop..
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.