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 <bits/stdc++.h>
#include <vector>
using namespace std;
string x;
int h;
int main(){
	getline(cin, x);
	for(int i = 0; i < x.length(); i++){
		h = (int)x[i];
		if(h >= 97 && h <= 122){
			h = h - 32;
			cout << char(h);
		}
		else
			cout << x[i];
	}
	cout << "\n";
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;

int main() {
	string s;
	cin >> s;
	transform(s.begin(), s.end(), s.begin(), ::toupper);
	cout << s << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  string s;
  getline(cin,s);
  rep(i,s.size()){
    if(s[i]>='a'&&'z'>=s[i])cout<<(char)(s[i]-'a'+'A');
    else cout<<s[i];
  }
  cout<<endl;
}

C++: #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
	string str ;
	int i , j , k ;
	getline( cin , str );
	for( i=0 ; i<str.size() ; i++ ){
		if( !islower( str[i] ) )
			str[i]= tolower( str[i] );
		if( !isupper( str[i] ) )
			str[i] = toupper( str[i] );
		cout << str[i];
	}
	cout << endl;
}

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

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)


int main(){
	
	string a;
	getline(cin,a);
	
	rep(i,a.size()){
		if(a[i]<='z' && 'a'<=a[i]){
			a[i] += 'A'-'a';
		}
	}
	
	cout<<a<<endl;
}

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

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

bool debug=false;
/*---------------------------------------------------*/

int main(){
  string s;

  while(cin>>s){
    if(s=="."){cout<<s;break;}
    rep(i,s.size()){
      int tmp;
      tmp=s[i]-'a';
      cout<<char('A'+tmp);
    }
    cout<<" ";
  }
  cout<<endl;
  
  return 0;
}

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

int main() {
	char in;
	while (in = getchar(),in!='\n') {
		if ('a' <= in && in <= 'z')
			cout << (char)(in - 0x20);
		else
			cout << in;
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>

using namespace std;

int main(){
    string s;
    char output[210];
    getline(cin,s);
    const char *input = s.c_str();
    int i;
    while(input[i] != '\0'){
        if(input[i] >= 'a' && input[i] <= 'z'){
            output[i] = input[i] - 32;
        }
        else{
            output[i] = input[i];
        }
        i++;
    }
    output[i] = '\0';
    cout << output << endl;
}

C++: #include <stdio.h>
#include <cctype>
int main(){
char ch[1500];
int i = 0;
while(1){
	i=0;
while(1){
    if(scanf("%c", &ch[i]) == EOF){
		return 0;
	}
    if ( ch[i] == '\n' ) break;
	i++;
}
i = 0;
while(1){

	if(islower(ch[i])){
		ch[i] = toupper(ch[i]);
	}	printf("%c",ch[i]);

	if ( ch[i] == '\n' ) break;
	i++;
}
}

}

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1234567;
const ll INF=1000000010;
const ll LINF=1000000000000000010LL;
const int MAX=10000010;
const double EPS=1e-3;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
int main(){
	string s;
	getline(cin,s);
	for(int i=0;i<s.length();i++){
		if('a'<=s[i]&&s[i]<='z'){
			int a=s[i]-'a';
			s[i]='A'+a;
		}
	}
	cout<<s<<endl;
	return 0;
}

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,b) FOR(i,0,b)
#define BE(c) c.begin(),c.end()
#define PB push_back
#define F first
#define S second
#define BEB(s) s
using namespace std;
int main(){
    string s;
    getline(cin, s);
    for(int i=0; i<s.size(); i++){
        //小文字なら大文字に 
        if(islower(s[i])) s[i]=toupper(s[i]);
    }
     
    cout<<s<<endl;
 
    return 0;
}

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

int main(){
	string s;
	getline(cin, s);
	for (int i = 0; i < s.length(); i++){
		printf("%c", toupper(s[i]));
	}
	cout << endl;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cctype>
#include<string>
using namespace std;
int main(){
  char a;
  string strin;
  while(scanf("%c",&a)!=EOF){
  if(a>='a' && a<='z')a-='a'-'A';
  strin+=a;
  }
  cout<<strin;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
  string str;
  getline(cin, str);
  for (char c : str) cout << (char)toupper(c);
  cout << endl;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
	char cent[100];
	for(int i=0;;i++){
		if(scanf("%c",&cent[i]) == EOF){break;}
		if(cent[i]>=97 && cent[i]<=122){cent[i]-=32;}
	}
	cout<<cent;
	return 0;
}

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

int main(void){

	char inp;

	while(scanf("%c",&inp)!=EOF){
		if(inp>=97&&inp<=122) inp-=32;
		printf("%c",inp);
	}
	printf("\n");
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  string s;
  getline(cin,s);
  transform(s.begin(),s.end(),s.begin(),::toupper);
  cout << s << endl;
  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 <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 << endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
using namespace std;
int main(){
	
	string x;
	
	getline(cin,x);
	transform(x.begin(),x.end(),x.begin(),toupper);
	cout<<x<<endl;
	

}

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

int main () {
	char n[10000];
	int end;
	
	gets(n);
	end = strlen(n);
	
	for ( int i = 0; i < end + 1; i++ ) {
		if ( n[i] >= 97 && n[i] <= 122 ) {
			printf("%c",(n[i] - 32));
		} else {
			printf("%c",n[i]);
		}
	}
	cout << endl;
	return 0;
}