Codeforces Round 156 (Div. 2)
A
Greg's Workout
Codeforces
800
原题
←B →
翻译中…

Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was $*n*$ integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$. These numbers mean that Greg needs to do exactly $*n*$ exercises today. Besides, Greg should repeat the $*i*$-th in order exercise $*a*_{*i*}$ times.

翻译中…

Greg now only does three types of exercises: "chest" exercises, "biceps" exercises and "back" exercises. Besides, his training is cyclic, that is, the first exercise he does is a "chest" one, the second one is "biceps", the third one is "back", the fourth one is "chest", the fifth one is "biceps", and so on to the $*n*$-th exercise.

翻译中…

Now Greg wonders, which muscle will get the most exercise during his training. We know that the exercise Greg repeats the maximum number of times, trains the corresponding muscle the most. Help Greg, determine which muscle will get the most training.

翻译中…

Input

翻译中…

The first line contains integer $*n*$ $(1 ≤ *n* ≤ 20)$. The second line contains $*n*$ integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ $(1 ≤ *a*_{*i*} ≤ 25)$ — the number of times Greg repeats the exercises.

翻译中…

Output

翻译中…

Print word "chest" (without the quotes), if the chest gets the most exercise, "biceps" (without the quotes), if the biceps gets the most exercise and print "back" (without the quotes) if the back gets the most exercise.

翻译中…

It is guaranteed that the input is such that the answer to the problem is unambiguous.

翻译中…

Note

翻译中…

In the first sample Greg does 2 chest, 8 biceps and zero back exercises, so the biceps gets the most exercises.

翻译中…

In the second sample Greg does 5 chest, 1 biceps and 10 back exercises, so the back gets the most exercises.

翻译中…

In the third sample Greg does 18 chest, 12 biceps and 8 back exercises, so the chest gets the most exercise.

翻译中…

样例

Input #1
2
2 8
Output #1
biceps
InputCopy OutputCopy
Input #2
3
5 1 10
Output #2
back
InputCopy OutputCopy
Input #3
7
3 3 2 7 9 6 8
Output #3
chest
InputCopy OutputCopy
题目信息
题号
255A
时间限制
2 s
内存限制
256 MB
标签
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。