Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	input := scanner.Text()
	input = strings.ToUpper(input)
	fmt.Println(input)
}

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
typedef long long LL; 

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	string str;
	getline(cin, str);
	
	for(size_t i = 0; i < str.size(); ++i){
		if('a' <= str[i] && str[i] <= 'z'){
			str[i] += 'A' - 'a';
		}
	}
	
	cout << str << endl;
	
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
int main(void){

	char s[1000];
	cin>>s;
	for(int i=0;i<1000;i++){
        s[i]=toupper(s[i]);
	}
	cout<<s;



	return 0;
}

C++: #include <cstdio>
//#include <algorithm>
//#include <iostream>
//#include <vector>
//#include <string>
//#include <cmath>
using namespace std;

int main(){
	char n[100];
	gets(n);
	for(int i=0;i<100;i++){
		if((n[i]>='a')&&(n[i]<='z')){
			n[i]=n[i]+'A'-'a';
		}
	}
	printf("%s\n",n);
return 0;
}

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

using namespace std;

int main(){

	string str;

	while (getline(cin, str)){
		for (int i = 0; i < str.size(); i++){
			if ((str[i] == ' ') || (str[i] == '.')) str[i] = str[i];
			else str[i] = (char)((int)str[i] - 32);
		}
		cout << str << endl;
	}

	return 0;
}

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

using namespace std;

int main(void){
	string str;

	getline(cin, str);

	for(int i=0;i<str.size();i++){
		if(str[i] >= 97 && str[i] <= 122){
			str[i] -= 32;
		}
	}

	cout << str << endl;
	return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
  string str;
  getline(cin,str);
  int i=0;
  for(i=0;i<str.size();i++){
    if(str[i]>='a'&&str[i]<='z') str[i]+='A'-'a';
  }
  cout << str << endl;
}

C++: #include <stdio.h>
int main(){
char c;
while(scanf("%c",&c)!=EOF){
if(c-'a'>=0&&c-'a'<26)c-=32;
printf("%c",c);
}
}

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

int main(){

  string ans;
  char c;

  while(scanf("%c",&c) != EOF){
    if('a'<=c && c<='z'){
      c = c-('a'-'A');
    }
    ans+=c;
  }

  cout << ans << endl;

  return 0;
}

C++: #include<iostream>
#include<string>
#include <stdio.h>
#include <math.h>
#include <cctype>
#include<queue>
#include<stack>
#include<cstdio>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
	string s;
	cin>>s;
	while(cin>>s){
		transform(s.begin(),s.end(),s,begin(),toupper);
		cout<<s<<" ";
	}
	cout<<endl;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cctype>

using namespace std;

int main(){
	string str;
	string ans;
	cin >> str;
	for(int i=0;i<str.size();i++){
		str[i] = toupper(str[i]);
	}
	cout << str << endl;
	return 0;
}

C++: #include<cstdio>
#include<cctype>
#include<cstring>
using namespace std;
int main(void)
{
	char a[100000];
	scanf("%[^\n]",a);
	int b = strlen(a);
	for(int i = 0;i < b;i++)
	{
		a[i] = toupper(a[i]);
	}
	printf("%s\n",a);
	return 0;
}

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

int main(void)
{
	char c;
	string str;

	while(scanf("%c", &c), c != '\n'){
		if(c >= 'a' && c <= 'z')
			c += 'A' - 'a';
		str.push_back(c);
	}
	cout << str << endl;

	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	string s;
	getline(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<string>
#include<algorithm>


using namespace std;


int main(){
	string str;

	getline(cin, str);
	transform(str.begin(), str.end(), str.begin(),toupper);
	cout << str << endl;


}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s

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

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	string str;
	getline(cin,str);
	for(int i=0;i<str.size();i++){
		if(str[i]>='a'&&str[i]<='z'){
		str[i]-=32;
		cout<<str[i];
		}else{
		cout<<str[i];
		}
	}
	cout<<endl;

	return 0;
}

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

#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false

int main()
{
    string hoge;
    getline(cin, hoge);
    rep(i, hoge.length())
    {
        if (hoge[i] != ' ')
        {
            hoge[i] -= ('a' - 'A');
        }
    }
    cout << hoge << endl;
}

C++: #include<cstdio>
#include<iostream>
int main(){
    int n,t=0;
    char str[2000];
    while(1){
        scanf("%c",&str[t]);
        if(str[t]=='\n'){
            n=t;
            break;
        }
        t++;
    }
    for(int i=0;i<n;i++){
        if('a'<=str[i]&&str[i]<='z')
            str[i]-=32;
    }
    for(int i=0;i<n;i++)
        printf("%c",str[i]);
    puts("");
    return 0;
}

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); }


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

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

	cout << str << endl;
}

C++: #include <iostream>

int main()
{
    int a;
    while (1)
    {
	a=getchar();
	if (a == EOF)break;
	if ('a'<=a && a<='z')
	{
	    a+='A'-'a';
	}
	putchar(a);
    }
    return 0;
}

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

int main(void){

	char inp;

	while(scanf("%c",&inp)!=EOF){
		putchar((inp>'a'&&inp<'z')?inp-32:inp);
	}
    return 0;
}

C++: #include<stdio.h>
int main(){
	int t='a'-'A';
	char s[201];
	fgets(s,201,stdin);
	for(int i=0;s[i]!='\0';i++)if(s[i] >= 97 && s[i] <=122)s[i]-=t;
	printf("%s",s);
return 0;
	}

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

using namespace std;

int main()
{
	char sta[210];
	cin.getline(sta, 210);
	string sa = sta;

	transform(sa.begin(), sa.end(), sa.begin(), toupper);
	cout << sa << endl;

	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
char ToUpper (char cX) { return toupper(cX); } 
using namespace std;

int main() {
	string in;
	getline(cin, in);
	transform(in.begin(), in.end(), in.begin(), ToUpper);
	cout<<in<<;
	return 0;
}