Problem:
Score : 100 points

Problem Statement

You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.
Print the acronym formed from the uppercased initial letters of the words.

Constraints

s_1, s_2 and s_3 are composed of lowercase English letters.

1 ≤ |s_i| ≤ 10 (1≤i≤3)

Input

Input is given from Standard Input in the following format:

s_1 s_2 s_3

Output

Print the answer.

Sample Input 1

atcoder beginner contest

Sample Output 1

ABC

The initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.

Sample Input 2

resident register number

Sample Output 2

RRN

Sample Input 3

k nearest neighbor

Sample Output 3

KNN

Sample Input 4

async layered coding

Sample Output 4

ALC

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
using namespace std;

int main(){
	long long int n;
	cin >> n;

	long long int a[n];
	for(int i = 0; i < n; ++i){
		cin >> a[i];
	}

	long long int count = 0;
	
	if(a[0] == 0){
		for(int i = 0; i < n; ++i){
			if(a[i] > 0){
				a[0] = -1;
				++count;
				break;
			}else if(a[i] < 0){
				a[0] = 1;
				++count;
				break;
			}
		}
	}

	long long int cal = a[0];

	if(a[0] == 0){
		count = 1 + 2 * (n - 1);
	}else{
		for(int i = 1; i < n; ++i){
			if(cal + a[i] == 0){
				if(cal < 0){
					++count;
					++a[i];
					cal = 1;
				}else{
					++count;
					--a[i];
					cal = -1;
				}
			}else if(cal < 0 && cal + a[i] < 0){
				count += -(cal + a[i] - 1);
				a[i] += -(cal + a[i] - 1);
			}else if(cal > 0 && cal + a[i] > 0){
				count += (cal + a[i] + 1);
				a[i] -= (cal + a[i] + 1);	
			}
		cal += a[i];
		}
	}

	cout << count << "\n";

	return 0;
}