Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func main() {
	scanner.Split(bufio.ScanLines)

	line := nextString()

	fmt.Println(strings.ToUpper(line))
}

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

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  string s;
  getline(cin, s);
  rep(i, s.size()) {
    if (s[i] >= 'a' && s[i] <= 'z') {
      s[i] = s[i] - 'a' + 'A';
    }
  }
  cout << s << '\n';
}

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

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

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

int main(){
	string in;
	int c;
	cin>> in;
	while(in[c]!='\0'){
		in[c]=toupper(in[c]);
		c++;
	}
	cout<<in;
	while(cin>>in){
		c=0;cout<<" ";
		while(in[c]!='\0'){
			if('a'<=in[c]&&in[c]<='z')
			in[c]=toupper(in[c]);
			c++;
		}
		
		cout<<in;
	}
	cout<<endl;

}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cctype>

using namespace std;

int main(void)
{
  char str[1000]={};
  int i;
  int len;

  gets(str);
  len=strlen(str);

  for(i=0;i<len;i++)
    str[i]=toupper(str[i]);

  printf("%s\n", str);


}

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

int main(){

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

C++: #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
	string str;
	int k=0;
	while(cin>>str){
		if(k!=0) cout<<" ";
		for(int i=0;i<str.length();i++){
			if(isalpha(str[i]))
				str[i] = toupper(str[i]);
		}
		cout<<str;
		k++;
	}
	//cout<<endl;
	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 <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<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){

	char a[100000];
	char b[100000];
    string w;
	while(getline(cin,w)){
	for(int i=0;i<w.size();i++){
       w[i]=toupper(w[i]);
	}
    cout<<w<<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++){
		if(0x61<=(int)s[i]&&(int)s[i]<=0x7A){
			s[i]-=0x20;
		}cout<<s[i];
	}cout<<endl;
}

C++: #include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <stdio.h>

using namespace std;

int main(){

	char s[500];

	fgets(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 s;
  getline(cin,s);
 
  for (int i=0; i<s.length(); i++) {
    s[i] = toupper(s[i]);
  }
  cout << s<< endl;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<cctype>
using namespace std;
int main(){
    string str;
    getline(cin,str);
    for(int i=0;i<str.length();i++)str[i]=toupper(str[i]);
    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);
    }
  }

  return 0;
}

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

string s;

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

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;
    return 0;
}

C++: #include<stdio.h>
int main(){
  for(int c;c=getchar()!=-1;)
    putchar((c>96)?(c-32):c);
}

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

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	char s[1000];
	fgets(s, 1000, stdin);
	REP(i, strlen(s)){
		if (islower(s[i])){
			s[i] = toupper(s[i]);
		}
	}
	cout << s << "\n";
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#define loop(i,a,b) for(int i=a ;i < b ; i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(void){
	string a;

	getline(cin,a);
	
	rep(i,a.size())a[i]=toupper(a[i]);
	
	cout<<a<<endl;
	return 0;
}