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++: #define _USE_MATH_DEFINES
#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <cctype>
#include <cstdlib>
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>
#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 <string>
#include <algorithm>

int main()
{
	std::string str{};

	std::cin >> str;

	std::transform( str.cbegin(), str.cend(), str.begin(), ::toupper);

	std::cout << str << std::endl;

	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<cctype>
#include<algorithm>
using namespace std;
int main(){
  string str;
  getline(cin , str);
  for(int i=0;i<str.size();i++){
    if(str[i] != ' ')str[i] -= 0x20;
  }
  cout << str << endl;
}

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

int main()
{
	string s;

	getline(cin, s);

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

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; ++i)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define PB push_back
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> Point;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1ll << 60;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };

#ifdef WIN32
#include "gtest/gtest.h"
#pragma comment (lib, "gtest.lib")
#define dump(x) cerr << #x << " = " << (x) << "\n"
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n"
#else
#define dump(x)
#define debug(x)
#endif

string str;
//#define severalTestCases

bool input() {
  getline( cin, str );
  return true;
}

string solve(string _str) {
  for ( int i = 0; i < _str.size(); i++ ) {
    if ( 'a' <= _str[ i ] && _str[ i ] <= 'z' ) {
      _str[ i ] += 'A' - 'a';
    }
  }
  return _str;
}

void putsanswer() {
  cout << solve(str) << "\n";
}

int main( int argc, char **argv ) {
#ifndef WIN32
#ifdef severalTestCases
  while ( input() ) {
#else
  input();
  solve();
#endif
#else
  ::testing::InitGoogleTest( &argc, argv );
  return RUN_ALL_TESTS();    // gtest ?????????
#endif
#ifdef severalTestCases
  }
#endif
  return 0;
}

#ifdef WIN32
TEST( testcase, solve ) {
  ASSERT_EQ( "THIS IS A PEN.", solve( "this is a pen." ) );
}
#endif

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

int main(){
	string x;
  	int i, count = 0;
   	while(cin >> x){
     	for(i = 0;i < x.size();i++){
        	if(x[i] >= 'a' && x[i] <= 'a'+ 25){
          		x[i] = 'A' + (int)(x[i] - 'a');
        	}
      	}
      	
    	if(count == 0){
      		cout << x ;
    	}
    	else cout << " " << x ;
      	count++;
  	}
  	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];         
    }
    cout<<endl;
    return 0;
}

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

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

C++: #import<cstdio>
int main(){	for(int c;~(c=getchar());putchar(c))c>96&&c<123?c-=32:0;}

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

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

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

	transform(str.begin(), str.end(), str.begin(), ToUpper());

	cout<<str.c_str()<<endl;
	return 0;
}

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

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	char v[200];
	fgets(v, 200, stdin);
	REP(i, 0, strlen(v)) {
		if (65 <= v[i] && v[i] <= 91) v[i] += 'a' - 'A';
		else if(92<=v[i] && v[i]<=118) v[i] -= 'a' - 'A';
		cout << v[i];
	}
	cout << endl;


	return 0;
}

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

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

C++: #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>

#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

#define LL long long int
#define LD long double

#define PI 3.14159265358979

using namespace std;

//================================================

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string S;
	
	getline(cin, S);
	transform(ALL(S), S.begin(), toupper);
	cout << S << "\n";
	return 0;
}