Go: package main

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

func main() {
        var s string
        sc := bufio.NewScanner(os.Stdin)
        sc.Scan()
        s = sc.Text()
        fmt.Println(strings.ToUpper(s))
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};

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

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

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

int main() {
	string str;
	getline(cin, str);
	transform(str.begin(), str.end(), str.begin(), toup());
	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.length(); i++)
    if( str[i] >= 'a' && str[i] <= 'z')
      str[i] -= 'a' - 'A';
  
  cout << str << endl;
  return 0;
}

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

int main(void){

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

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

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

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

int main(void){
  char str[100000];
  int flg = 0;

  while(1){

    cin >> str;
    if( flg == 1 ) cout << " ";
    else if( flg == 2 ) break;
    else flg = 1;
   
    for( int i = 0 ; i < strlen(str) ; i++ ){    
      str[i] -= 'a'-'A';
    if( 'A' <= str[i] && str[i] <= 'Z' ) cout << str[i];
    else{ cout << "."; flg = 2; }
    }
  }
  cout << endl;
  return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;

#define ISEQ(c) (c).begin(), (c).end()
typedef long long ll;

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

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

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

int
main(void)
{
	char line[256];

	if (fgets(line, sizeof line, stdin)) {
		int len = strlen(line);
		for (int i = 0; i < len; i++) {
			if (islower(line[i])) {
				line[i] = toupper(line[i]);
			}
		}
		
		printf("%s", line);
	}

	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <cstring>
#include <functional>

using namespace std;

#define REP(i,a,b) for((i)=(a);(i)<(int)(b);(i)++)
#define rep(i,n) REP(i,0,n)
// BEGIN CUT HERE
#define foreach(itr,c) for(typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
// END CUT HERE

int main(){
  int i;
  string str;

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

  return 0;
}

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;
	cin >> h;
	transform(all(h), h.begin(), ::toupper);
	cout << h << endl;
}

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

#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)
#define mset(a, n) memset(a, n, sizeof(a))

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;

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

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

using namespace std;

int main(){
    string s,str("");
    cin >> s;
    str += s;
    while(cin >> s){
        str +=  " ";
        str += s;
    }
    transform(str.begin(), str.end(), str.begin(), ::toupper);
    cout << str << endl;
}

C++: #include<stdio.h>
#include<string.h>
int main(void) {
	int a;
	char str[100];
	while (scanf("%[^\n]", str) != EOF) {
		for (int i = 0; i <= strlen(str); i++)
		{
			if (str[i] >= 97 && str[i] <= 122)
			{
				str[i] = str[i] - 32;
			}
			printf("%c", str[i]);
		}
		printf("\n");
	}
	return 0;
}

C++: //#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef vector< vector<ll> > mat;
const ll M = 10007;

int main(){
    string str;
    getline(cin,str);
    for(int i=0;i<str.size();i++){
	int n = (int)(str[i]);
	if(97 <= n && n <= 122) str[i] = (char)(n - 32);
    }
    cout << str << endl;


    return 0;
}

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

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>

std::string str;

int main() {
    getline(std::cin, str);

    int len = str.length();
    for(int i=0; i < len; ++i) {
        char c = str[i];
        if(c >= 'a' && c <= 'z') {
            char upper = (c - 'a') + 'A';
            std::cout << upper;
        } else {
            std::cout << c;
        }
    }
    std::cout << std::endl;
}

C++: #include<stdio.h>
#include<string.h>
int main(void)
{
	char s[10000];
	int len,i;
	fgets(s,10000,stdin);
	len=strlen(s);
	for(i=0;i<len;i++){
		if(s[i] >= 'a' && s[i] <='z'){
			s[i] -= 'a' - 'A';
		}
		printf("%c",s[i]);
	}
	printf("\n");
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstring>
using namespace std;
char chang(char s)
{
	return s>='a'&&s<='z'?s+'A'-'a':s;
}
int main()
{
	string s;
	int l;
	getline(cin,s);
	l=s.length();
	for (int i=0;i<l;i++)
	  cout<<chang(s[i]); 
}