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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

using namespace std;

string s;

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

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

using namespace std;
static const int MAXV=1000;

int main() {
  while(!feof(stdin)) {
    char data[MAXV];
    if(fgets(data, sizeof(data), stdin) == NULL) break;
    for(int i=0; data[i] != '\n'; i++) {
      if('a' <= data[i] && data[i] <='z')
	printf("%c", data[i]-32);
      else printf("%c", data[i]);
    }
    printf("\n");
  }
}

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

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

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

using namespace std;

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

	for(char& c : line)
		if('a' <= c && c <= 'z')
			c -= ('a' - 'A');

	cout << line << endl;

	return 0;
}

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

using namespace std;

int main(){
	string ch;
	int i;

	getline(cin, ch);

		for(i=0; i<ch.size(); i++){

		if(isalpha(ch[i]){
			ch[i] = toupper(ch[i]);
		}
	}

	cout << ch << endl;
}

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

using namespace std;


int main(){
	
	char A[200] = {};
	
	cin.getline(A, 200);
	
	string B;
	
	B = A;
	
	for(int i=0;i<B.length();i++) {
		
		if ( B[i] >= 'A' && B[i] <= 'Z')
		B[i] += ' ';
		else if ( B[i] >= 'a' && B[i] <= 'z')
		B[i] -= ' ';
	}
	cout << B << "\n";
    return 0;
}

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

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

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

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

C++: #include <cstdio>

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

C++: #include <iostream>
#include <ctype.h>
using namespace std;
void str_toupper(char *str)
{
	do{
		*str = toupper(*str);
	}while(*str++);
}
int main(void)
{
	char str[10000];
	fgets(str,sizeof(str),stdin);
	str_toupper(str);
	cout << str;
	return 0;
}

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

#define ll long long int

using namespace std;
typedef pair<int, int> P;


int main()
{
  char str[100];
  int i=0,j;
  while(1){
    scanf("%c",&str[i]);
    if(str[i]=='.')break;
    i++;
  }
  str[i+1]='\0';
  for(j=0;j<i;j++){
    str[j]=toupper(str[j]);
  }
  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(97<=v[i] && v[i]<=123) v[i] -= 'a' - 'A';
		cout << v[i];
	}
	cout << endl;
	


	return 0;
}

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

using namespace std;

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

    for (int i = 0; i < s.size(); ++i) cout << (char)toupper(s[i]);
    
    cout << endl;
}

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

int main(){
  int i = 0;
  char str[129], str2[129];
  
  fgets(str, 128, stdin);

  while(1){
    if('A' <= str[i] && str[i] <= 'Z'){
      str2[i] = str[i] - 0;
    }else if(str[i] == '.'){
      str2[i] = '.';
    }else if(str[i] == ' '){
      str2[i] = ' ';
    }else if(str[i] == '\n'){
      str2[i] = '\0';
      break;
    }else{
      str2[i] = str[i] - 'a' + 65;
    }

    i++;
  }
  
  cout << str2 << endl;

  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
signed main(){
        char buf[256];
        while ( fgets(buf, 256, stdin) != NULL ) {
                string str(buf);
                transform(str.cbegin(), str.cend(), str.begin(), ::toupper);
                cout << str;
        }
        return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
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]-=32;
            cout << s[i];
        }
        cout << '\0';
    }
    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();
  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