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>
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();
  putsanswer();
#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 <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
typedef pair<int,int> pii;

string genstr(string& s){
	string ans="";
	rp(i,s){
		if('A'<=s[i] && s[i]<='z'){
			ans+=s[i]-('a'-'A');
		}else{
			ans+=s[i];
		}
	}
	return ans;
}
int main()
{
	string n;
	getline(cin,n);
	cout << genstr(n) << endl;
}

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

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

	return 0;
}

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

int main(){
	char input[1000];
	for(int i=0; i < 1000; i++) input[i] = '\0';
	while(scanf("%c", input) != EOF){
		for(int i=0; i < strlen(input); i++){
			if('a' <= input[i] && input[i] <= 'z'){
				input[i] += 'A' - 'a';
			}
			cout << input[i];
			input[i] = '\0';
		}
	}
}

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

using namespace std;

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

int main()
{
	solve();
	return(0);
}

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

int main()
{
	char Sentence[201];
	fgets(Sentence, 201, stdin);
	for(int i = 0; i < 201; i++){
		if('a' <= Sentence[i] && Sentence[i] <= 'z'){
			Sentence[i] += 'A' - 'a';
		}
	}
	printf("%s\n", Sentence);
	return 0;
}

C++:   1 #include<iostream>
  2 #include<ctype.h>
  3 
  4 using namespace std;
  5 
  6 #define OUT cout <<
  7 #define IN cin >>
  8 #define E << endl;
  9 #define FOR(i,a,b) for(int i = a;i < b;i++)
 10 
 11 
 12 string str;
 13 
 14 
 15 int main(){
 16     while(IN str){
 17         FOR(i,0,str.size()){
 18             str[i] = (char)toupper((int)(str[i]));
 19         }
 20         OUT str << " ";
 21 }
 22     OUT "\n";
 23 
 24 }
 25

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

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

C++: #include <stdio.h>

int main() {
	char ch[200];
	gets(ch);
	for (int i=0; i<200; i++)
	{
		if (ch[i] >= 'a' && ch[i] <= 'z')
		{
			ch[i]-=32;
		}
	}
	printf("%s",ch);
}

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

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

int main() {
  string str; 
  int flag = 1;
  while ( flag ) {
    cin >> str;
    if ( str[str.size()-1] == '.' ) flag = 0;
    for ( int i = 0; i < str.size(); i++ ) {
      if ( str[i] >= 'a' && str[i] <= 'z' ) {
	str[i] -= 32;
      }
    }
    cout << str << " ";
  }
  cout << endl;
  return 0;
}

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

int main(){

  string str;

  getline(cin,str);

  for(int i=0;i<str.size();i++){
    if(str[i]<123 && str[i]>96) printf("%c",str[i]-32);
    else cout << str[i];
  }
  cout << endl;
}

C++: #include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
#define ARRAY_MAX 200

int main(void){

    char array[ARRAY_MAX];

    int i = 0;

    fgets(array,ARRAY_MAX,stdin);

    while(array[i] != '\0'){
        array[i] = toupper(array[i]);
        i++;
    }
    
    cout << array << endl;
    
    return 0;
}