Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	fmt.Println(strings.ToUpper(sc.Text()))
}

C++: #include<stdio.h>
#include<string.h>
#include<iostream>

using namespace std;

int main(){
	char mes[256];
	cin.getline(mes,256);
	int i;
	for(i=0;i<strlen(mes);i++)
		mes[i]=toupper(mes[i]);
	printf("%s\n",mes);
}

C++: #include <iostream>
#include <string>
using namespace std;


int main(int argc, char *argv[]){
	string s;
	getline(cin,s);
	for (int i = 0; i < s.length(); ++i){
		if(s[i]<='z' && s[i]>='a')
			s[i]=s[i]-('a'-'A');
	}
	cout<<s<<endl;
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;


int main()
{
	string s;
	getline(cin, s);
	for (int i = 0; i < s.length(); i++){
		if ('a' <= s[i] && s[i] <= 'z'){
			s[i] = s[i] - ('a'- 'A');
		}
	}
	cout << s;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>

typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;

int main(){
	string a;
	getline(cin, a);
	transform(a.cbegin(), a.cend(), a.begin(), ::toupper);
	cout << a << endl;
	return 0;
}

C++: #include<cstdio>
using namespace std;

int main(){
	char str[1024], *s;
	gets(str);
	int i=0;
	while(str[i++]!='\0');
	s = new char[i];
	for( int j=0; j<i; j++ ){
		s[j] = str[j];
		if( ('a'<=s[j])&&(s[j]<='z') ){
			s[j] -= 32;
		}
	}
	printf("%s", s);
	delete[] s;
	s=0;
	return 0;
}

C++: #include <stdio.h>

int main() {
	char str[1024];
	int i;

	fgets(str, 1024, stdin);
	i = 0;
	while(str[i] != '\n') {
		if(str[i] == ' ')
			putchar(' ');
		else if(str[i] == '.')
			putchar('.');
		else
			putchar(str[i] + 'A' - 'a');

		i++;
	}

	putchar('\n');

	return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

char ToUpper(char cX) { return toupper(cX); }

int main() {
	string str;
	getline(cin, str);
	transform(str.begin(), str.end(), str.begin(), ToUpper);
	cout << str << endl;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑

int main() {
	string h;
	getline(cin, s);
	transform(all(h), h.begin(), ::toupper);
	cout << h << endl;
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }


struct ToUpper {
    char operator()(char c) { return toupper(c); }
};

int main()
{
	string str;
	getline(cin, str);

	transform(ALL(str), str.begin(), ToUpper());

	cout << str << endl;
}

C++: #include <iostream>
#include <string>

using namespace std;

int main() {

	string s;

	while(cin >> s) {
		for(int i=0; i<s.size(); i++) {
			if(s[i]>='a'&&s[i]<='z')
				s[i]-=('a'-'A');
		}
		cout << s << endl;
	}


	return 0;

}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cctype>

using namespace std;

int main() {

	string st;

	while (getline(cin, st)) {
		transform(st.begin(), st.end(), st.begin(), toupper);

		cout << st << endl;
	}


	return 0;
}

C++: #define _USE_MATH_DEFINES

#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

using namespace std;

int main()
{
	string s;
	getline(cin, s);

	transform(s.begin(), s.end(), s.begin(), ::toupper);

	cout << s << endl;
}

C++: #include <iostream>
#include <string>
#include <cstdlib>

using namespace std;

void solve()
{
	string str;
	getline(cin, str);
	for(int i = 0; i < str.size(); ++i)
	{
		printf("%c", toupper(str[i]));
	}
	cout << endl;
}

int main()
{
	solve();
	return(0);
}

C++: #include <iostream>
#include <string>

using namespace std;

int main(void)
{
	string str;
	getline(cin, str);

	for(char& c : str){
		if(c >= 'a' && c <= 'z'){
			c += 'A' - 'a';
		}
	}


	cout << str << endl;


	return 0;
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
    int i,n;
    string a;
    getline(cin,a);
    for(i=0; i<a.size(); i++){
             if(a[i]!='.')
             a[i]=a[i]-32;    
    }
    cout<< a<<endl;
    return 0;
}

C++: #include<stdio.h>
int main(){
	for(int c;~(c=getchar());putchar(c))
		c>='a'&&c<='z'?c-=32:0;
}

C++: #include <iostream>
#include <string>
using namespace std;

int main(){
	string s;

	getline( cin, s );

	for ( unsigned i = 0; i < s.size(); ++i ){
		if ( s[ i ] >= 'a' && s[ i ] <= 'z' ){
			s[ i ] = s [ i ] - 'a' + 'A';
		}
	}

	cout << s << endl;

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int size = 1000;
char text[1000];

int main() {

	gets(text);

	for (int i = 0; i < size; i++) {
		if (text[i] == EOF) break;
		if (text[i] >= 'a' && text[i] <= 'z') text[i] += 'A' - 'a';
	}

	cout << text << endl;

	return 0;
}

/*@@@@@@@@@@@@@@@@@@@@@@@@@*/
/*@                       @*/
/*@ debug output erased ? @*/
/*@                       @*/
/*@@@@@@@@@@@@@@@@@@@@@@@@@*/

C++: #include<iostream>
#include<string>
using namespace std;
int main()
{
    string s;
    getline(cin,s);
    for (int i=0;i<s.size();i++)
    {
          s[i]=toupper(s[i]);
    }
    cout<<s;
    cout<<endl;
}

C++: #include<iostream>
#include<string>
using namespace std;
int cha(char a){
	char c='A';
	for(char b='a';b<='z';b++){
		if(a==b)return c;
		c++;
	}
	return a;
}
int main(){
	string a;
	int i=0,j=0,k=0,t=0;
	char b[100];
	while(cin>>a){
		t=a.size();
		for(k=0;k<t;k++){
			b[i]=cha(a[k]);
			i++;
		}
		b[i]=' ';
		i++;
	}
	for(j=0;j<i;j++){
		cout<<b[j];
	}
	cout<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	ios :: sync_with_stdio(false);
	string s;
	getline(cin, s);
	for(char &c : s)
		c = toupper(c);
	cout << s << '\n';
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;

int main()
{
    string s;
    cin>>s;
    for(int i=0;i<s.length();i++){
        if(s[i]>='a'&&s[i]<='z')
            s[i]+='A'-'a';
    }
    cout<<s<<endl;
    return 0;
}