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 <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)


int main(){
	char st[500];
	int i = 0;
	//cout<<"hoge";
	for(int i = 0;;i++){
		scanf("%c",&st[i]);
		if(st[i] == '.'){
			break;
		}
	}
	//cin >> st;
	
	rep(i,20){
		//printf("%c %d\n",st[i],st[i]);
	}
	//printf("a = %d z = %d A = %d Z = %Z\n",'a','z','A','z');
	i = 0;
	while(st[i]!='.'){
		//printf("st[%d] = %d\n",i,st[i]);
		if(st[i]<='z'&&st[i]>='a'){
			//cout<<"before "<<st[i]<<endl;
			
			st[i]+=-'a'+'A';
			//cout<<"after "<<st[i]<<endl;
		}
		i++;
	}
	//cout<< st << endl;
		printf("%s\n",st);
	
	 return 0;
}

C++: //0020 Capitalize
//ツ禿シツ療債つウツづェツつスツ閉カツ篠堋療アツづーツ、ツ渉ャツ閉カツ篠堋づ債妥・ツ閉カツ篠堋づ可陛渉環キツつオツつスツ閉カツ篠堋療アツづーツ出ツ療債つケツづヲ
//ツづ按つィツ閉カツ篠堋療アツづ可づ債アツδ仰フツァツベツッツトツ、ツ板シツ角ツスツペツーツスツ、ツピツδ環オツドツつェツ甘慊づ慊づェツづゥ

#include<iostream>
#include<string>
#include<cctype>
using namespace std;

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

	for(int i = 0; i < str.size(); i++)
	{
		if(islower(str[i]))
			str[i] = toupper(str[i]);
	}

	cout << str << endl;

	return 0;
}

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

int main() {
	char ch[200];
	gets(ch);
	for (int i=0; i<200; i++)
	{
		if (ch[i] >= 'a' && ch[i] <= 'z')
		{
			ch[i]-=32;
		}
	}
	printf("%s",ch);
}

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

int main(){
	string input;
	while(true)
	{
		string temp;
		cin >> temp;
		if(cin.eof()) break;
		input += temp;
		input += ' ';
	}
	int length = input.size();
	for(int i = 0;i<=length;i++)
		if(input[i]>=97&&input[i]<=122)input[i]=(char)input[i]-32;
	
	cout << input.substr(0,length-1) << endl;
	return 0;
}

C++: void main(){
	char s[999];
	int i,j=0;
	for(;~scanf("%s",s);printf(" %s",s))
		for(i=0;s[i];i++)
			s[i]>='a'&&s[i]<='z'?s[i]-=32:0;
	puts("");
}

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] -= 'a' - 'A';
    }
    cout << str << endl;
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
  char c;
  while((c = getchar())!=EOF){
    if('a'<=c && c<='z'){
      printf("%c", c-'a'+'A');
    }else{
      printf("%c", c);
    }
  }
  printf("\n");

  return 0;
}

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

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int len,i,j;
	char s;
	while(scanf("%c",&s)!=EOF) {
		
		if('A'<=s && 'Z'>=s) printf("%c",s);
		else if('a'<=s && 'z'>=s){
			s=s-('a'-'A');
			printf("%c",s);
		}
		else printf("%c",s);
	}
	printf("\n");
	return 0;
}

C++: #include <iostream>
#include <string>
#include <stdlib.h>
#include <cstdio>
using namespace std;
int main()
{
	string s;
    getline(cin,s);
	for(int i=0;i<s.size();i++){
		char c=s[i];
		(97<=c&&c<=122)?printf("%c",c-32):printf("%c",c);
	}
	cout<<endl;
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    string s;
    while (getline(cin, s)) {
        if (s.size() > 0 && s[s.size()-1] == '\r') s.resize(s.size()-1);
        rep (i, s.size()) if (islower(s[i])) s[i] = toupper(s[i]);
        cout << s << endl;
    }
    return 0;
}

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

int main(void){

	char inp,data[100000];
	int cnt=0;

	while(scanf("%c",&inp)!=EOF){
		if(inp>=97&&inp<122) inp-=32;
		cnt++;
		data[cnt]=inp;
	}
	for(int i=1;i<=cnt;i++){
		printf("%c",data[i]);
	}
	printf("\n");
    return 0;
}

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

int main()
{
	char s[200];
	cin >> s;
	for (int a = 0; a < strlen(s); a++) {
		s[a] = s[a] - 32;
		cout << s[a];
	}
	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-1;j++){
		cout<<b[j];
	}
	cout<<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[i];         
    }
    return 0;
}

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-1;j++){
		cout<<b[j];
	}
	cout<<endl;
}

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


int main() {
  int n;
  string str;

  /*  while(cin >> str) {
    n = str.size();
    for(int i=0;i<n;i++) {
      if((str[i] <= 122) && (str[i] >= 97)) {
        str[i] -= 32;
      }
    }
    if(str[n-1] == 46)
      cout << str;
    else
      cout << str << " ";
  }
}
  */
  getline(cin,str);
  n = str.size();
  for(int i=0;i<n;i++) {
    if((str[i] <= 'z') && (str[i] >= 'a')) {
      str[i] -= 32;
    }
  }
  cout << str << endl;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <complex>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
const double PI = 3.141592653589793238462643383279502884L;
const int LARGE_PRIME = 1000000007;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i,a,cont,next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i,a,b,s) repfn(i,a,i<b,i+s)
#define repab(i,a,b) repby(i,a,b,1)
#define rep(i,b) repab(i,0,b)
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  int c;

  while ((c = getchar()) != EOF) {
    if (islower(c))
      c = toupper(c);
    printf("%c", c);
  }
  return 0;
}

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

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