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 <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>

using namespace std;


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

C++: #include<stdio.h>
int main(){
	char c;
	for(;~(c=getchar());printf("%c",c))
		c>='a'&&c<='z'?c-=32:0;
}

C++: #include<iostream>
#include<algorithm>
#include<functional>
#include<string>
#include <cctype>
#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;
	return 0;
}

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

int main()
{
	char sastr;
	sastr = 'a' - 'A'; //大文字と小文字の差
	string str;
	char newch;
	getline(cin,str);	
	for (int i = 0 ; i < str.size() ; i++)
	{
		if (( str[i] >= 'a') && ('z' >= str[i]))
		{
			newch =+ str[i] - sastr;
		} else 
		{
			newch =+ str[i];
		}
		cout << newch;	
	}
	cout <<endl;
	return 0;
}

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

int mian(void){
	int len,cut_i;
	char str[1000];

	scanf("%[a-z .]",str);

	len = strlen(str);

	for(cut_i=0; cut_i<len; cut_i++){
		str[cut_i] = tolower(str[cut_i]);
	}
	
	puts(str);

	return 0;
}

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

int main(void) {
  char a[200];
  int i, s = 0;
  while(scanf("%s", a) != EOF) {
    if(s) printf(" ");
    s = 1;
    for(i = 0; i < strlen(a); ++i) {
      if(a[i] >= 'a' && a[i] <= 'z') a[i] += 'A' - 'a';
      printf("%c", a[i]);
    }
  }
  printf("\n");
  return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
char ToUpper (char cX) { return toupper(cX); } 
using namespace std;

int main() {
	string in;
	getline(cin, in);
	transform(in.begin(), in.end(), in.begin(), ToUpper);
	cout<<in;
	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<math.h>

#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)      memset((a),0,sizeof(a))
#define MCLR(a)     memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int main(){
	string str;
	int i;
	getline(cin,str);
	transform(str.begin(),str.end(),str.begin(),::toupper);
	cout << str << endl;
	return 0;
}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	string s;
	getline(cin, s);
	REP(i, s.size()) {
		if ('a' <= s[i] && s[i] <= 'z') {
			s[i] = s[i]+'A'-'a';
		}
	}
	cout << s << endl;
}

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

int main(){
	char ch;
	while(scanf("%c", &ch) != EOF){
		if(ch >= 'a' && ch <= 'z') ch = ch + ('A' - 'a');
		printf("%c", ch);
	}
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


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

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

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

    for (auto &c: input) c = toupper(c);

    cout << input <<endl;
}

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

int main()
{
	std::string input_text;
	std::getline(std::cin, input_text);
	std::transform(
			input_text.begin(), input_text.end(),
			std::ostream_iterator<char>(std::cout, ""),
			static_cast<int(*)(int)>(&std::toupper));
	std::cout << std::endl;

	return 0;
}

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

int i=0,n=1;
char s[1005];

int main(){
	gets(s);
	for(i=0;i<strlen(s);i++){
		if(s[i]>96 && s[i]<123)s[i]=s[i]-32;
	}
	printf("%s\n",s);
	return 0;
}

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

#define PI 4*atan(1);

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

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

using namespace std;

int main(void){
	
	int i;
	char a;
	vector<char> str;
	
	while(scanf("%c",&a)!=EOF){
		if('a'<=a&&a<='z'){
			a=toupper(a);	
			str.push_back(a);
		}
	}
	
	a=str.size();
	
	for(i=0;i<a;i++){
		cout<<str[i];
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <map>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdio>
#include <climits>
using namespace std;
#define rep(i,n) for(LL i=0;i<n;i++)
#define all(v)	(v).begin(),(v).end()
#define MOD  1000000007
const int INF = INT_MAX;
typedef long long LL;


int main(){
	string s;
	getline(cin, s);
	transform(s.begin(), s.end(), s.begin(), toupper);
	cout << s << endl;
	return 0;
}