Algorithm

A. Greg's Workout
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/255/A
input
standard input
output
standard output

Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. These numbers mean that Greg needs to do exactly n exercises today. Besides, Greg should repeat the i-th in order exercise ai 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 a1, a2, ..., an (1 ≤ ai ≤ 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.

Examples
input
Copy
2
2 8
output
Copy
biceps
input
Copy
3
5 1 10
output
Copy
back
input
Copy
7
3 3 2 7 9 6 8
output
Copy
chest
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.

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 25;
int n, a[N];

int main() {
  int r1 = 0, r2 = 0, r3 = 0;
  scanf("%d", &n);
  for(int i = 0, tmp; i < n; ++i)
    scanf("%d", a + i);
  
  for(int i = 0; i < n; i += 3)
    r1 += a[i], r2 += a[i + 1], r3 += a[i + 2];
  
  int mx = max(r1, max(r2, r3));
  if(mx == r1)
    puts("chest");
  else if(mx == r2)
    puts("biceps");
  else if(mx == r3)
    puts("back");
  
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2
2 8

Output

x
–
+
cmd
biceps
Advertisements

Demonstration

Codeforces Solution-Greg's Workout-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+