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 <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include <cctype>
#include <climits>
#include <fstream>

using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a) 
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;

string shift_str(string str)
{
    int ascii;
    string ret;
     
    for (int i=0; i<str.length(); i++)
    {
        ascii = str[i];   
        if (!('a' <= ascii && ascii <= 'z'))
        {
            ret += ascii;
        } else {
        	ret += ((ascii - 'a') + 'A');
        }
         
    }
     
    return ret;
}
 
int main()
{
    string str;
    string ret;
     
    getline(cin,str);
    ret += shift_str(str);
    cout<<ret<<endl;
    return 0;
}

C++:  
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 
 using namespace std;
  
 int main()
 {
   string a,b;
   getline(cin,a);
     for(int i=0;i<a.length();i++)
     { 
       if(a[i]>='a'&&a[i]<='z') b[i]=('A'+(a[i]-'a'));
       else b[i]=a[i];
     }
     cout<<b<<endl;
   //while(1);      
   return 0;    
 }

C++: #include <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;

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

	for (int i = 0; i < s.length(); i++) {
		if (s[i] >= 'a' && s[i] <= 'z') {
			cout << (char)(s[i] - 0x20);
		}
		else {
			cout << s[i];
		}
	}

	cout << endl;
}

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


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

  for(int i=0; i<S.length(); i++){
    if(S[i] != ' ' && S[i] != '.'){
      S[i] = (S[i]-'a') + 'A';
    }
  }

  cout << S << endl;

}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define EXIST(v,i) (find(all(v), i) != (v).end())
#define ERASE(v,i) (v).erase(remove(all(v), i), (v).end())
#define INDEX(v,i) (find(all(v), i) - (v).begin())
#define rep(i,n) for(int i = 0; i < (int)n; ++i)
#define debug(x) cerr << #x << " = " << (x) << endl;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

const int INF = 100000000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-10;

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

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

int main(void){

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

C++: #include <iostream>

using namespace std;
int main(void){
    // Here your code !
string c;
getline(cin,c);

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

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>


int main(){
	std::string word, ans;

	getline(std::cin, word);
	std::transform(word.begin(), word.end(), word.begin(), toupper);
	std::cout << word << std::endl;

	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main() {
    string s;

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

        cout << s << endl;
    }

    return 0;
}

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

int main(){
	char s[10001];
	cin.getline(s,10000);
	int c = strlen(s);
	while(c--)
		if('a' <= s[c] && s[c] <= 'z')
			s[c] += 'A' - 'a';
	cout << s << "\n";
	return 0;
}

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

int main() {
	string s;
	getline(cin,s);
	for(int i=0;i<=s.size();i++){
		if(0x61<=(int)s[i]&&(int)s[i]<=0x7A)a{
			s[i]-=0x20;
		}cout<<s[i];
	}
}

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] -= 32;
    }
  }
  cout << s << endl;
  return 0;
}

C++: #include <cmath>
#include <iostream>
#include <cstdio>
#include <ctype.h>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <sstream>

using namespace std;

int main()
{
	char c;
	while(1)
	{
		if((c=getchar())==EOF)break;
		if(c>='a'&&c<='z')printf("%c",c+('A'-'a'));
		else printf("%c",c);
    }
	
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
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 <stdio.h>

int main(void){
	char c;
	while(~scanf("%c",&c)){
		if('a'<=c && c<='z')
			c += 'A'-'a';
		std::cout << c << std::flush;
	}
	std::cout << std::endl;
}

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

int main(void)
{
    string str;
    getline(cin, str);
    for (int i = 0; i < str.size(); ++i) {
        if ('a'<= str[i] && str[i] <= 'z')
            str[i] = 'A' + str[i] - 'a';
    }
    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 <bits/stdc++.h>
using namespace std;

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

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
	string s;
	getline(cin, s);
	transform(s.begin(), s.end(), s.begin(), ::toupper);
	cout << s << endl;
	return 0;
}