# 忽若流星

## 从一道简单题谈程序设计的思维

Stick
Problem

Anthony has collected a large amount of sticks for manufacturing chopsticks. In order to simplify his job, he wants to fetch two equal-length sticks for machining at a time. After checking it over, Anthony finds that it is always possible that only one stick is left at last, because of the odd number of sticks and some other unknown reasons. For example, Anthony may have three sticks with length 1, 2, and 1 respectively. He fetches the first and the third for machinning, and leaves the second one at last. Your task is to report the length of the last stick.

Input

The input file will consist of several cases.
Each case will be presented by an integer n (1 <= n <= 100, and n is odd) at first. Following that, n positive integers will be given, one in a line. These numbers indicate the length of the sticks collected by Anthony.
The input is ended by n = 0.

Output

For each case, output an integer in a line, which is the length of the last stick.

Sample Input
`31210`
Sample Output
2

posted on 2009-03-29 15:35 yuyang7 阅读(1897) 评论(2)  编辑 收藏 引用 所属分类: 程序设计竞赛

## #re: 从一道简单题谈程序设计的思维  回复更多评论

2009-04-03 09:55 | Kven-KeRoX

## #re: 从一道简单题谈程序设计的思维回复更多评论

xor
2013-11-18 08:26 | E