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++: 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#endif

#define ITER(c)         __typeof__((c).begin())
#define FOREACH(it, c)  for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)        __typeof__((c).rbegin())
#define RFOREACH(it, c) for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)       REPEAT(i, 0, n)
#define REPEAT(i, k, n) for (int i = (k); i < (n); ++i)
#define REVREP(i, n)    for (int i = ((n)-1); i >= 0; --i)
#define FIND(c, n)      std::find((c).begin(), (c).end(), (n));
#define BSEARCH(c, n)   std::binary_search((c).begin(), (c).end(), (n))
#define LLPOW(p1,p2)    ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)      (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2)      (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2)      (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC     do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)       fgets((p), sizeof(p), stdin)
#define CHOMP(p)        do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n') *_q = 0; } while(0)

int main(){

    string s;
    getline(cin, s);
    FOREACH(it, s){
        if(isalpha(*it)){
            *it = toupper(*it);
        }
    }
    cout << s << endl;
    return 0;
}

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 <iostream>
using namespace std;
int main()
{
	char c, d = 'A' - 'a';
	while (cin.get(c)){
		if (c == '\n') break;
		if ('a' <= c && c <= 'z') c += d;
		cout << c;
	}
	cout << "\n";
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
using namespace std;
&#160;
int main(){
&#160;
char ch;
&#160;
while(1){
&#160;&#160;&#160;&#160;scanf("%c", &ch);
&#160;&#160;&#160;&#160;if ( ch == '\n' ) break;
&#160;&#160;&#160;&#160;char d=toupper(ch);
&#160;&#160;&#160;&#160;cout<<d;
}
&#160;&#160;&#160;&#160;cout<<endl;
}

C++: #include<iostream>
#include<algorithm>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<string>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
#define FOR(i, j, k) for(int i = j; i < k; i++)

int main(){
    string str;
    getline(cin, str);
    REP(i, str.length()) cout <<(char)(toupper(str[i]));
    cout <<endl;
    return 0;
}

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

C++: #define scanf_s scanf
#define gets_s gets
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 201
#define _MAX 100
#define ABC 26
int main(void)
{
	int n;
	char str[MAX];
	long long int ans = 1;
	gets_s(str);
	for (int i = 0; str[i] != '\0'; ++i) {
		if ('a' <= str[i] && str[i] <= 'z') {
			str[i] = str[i] - 'a' + 'A';
		}
	}
	printf("%s\n", str);
}

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

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

  while(str[i] != '\n'){
    if('a' <= str[i] && str[i] <= 'z'){
      str[i] = str[i] - 'a' + 65;
    }
    i++;
  }
  
  cout << str << flush;

  return 0;
}

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

int main(void) {
	int k=0;
	string str;
	while (cin >> str) {
		if (k != 0) cout << " ";
		k++;
		for (int i = 0; i < str.length(); i++) {
			if ('a' <= str[i] && str[i] <= 'z') str[i]+='A'-'a';
		}
		cout << str;
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdlib>
#include <string>
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 <iostream>
#include <algorithm>
using namespace std;

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

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

int n, s;

int Comb(int N, int start, int s)
{
	int ret = 0;

	if (s < 0)
		return 0;

	if (N == n)
		if (start == s)
			return 1;
		else
			return 0;

	for (int i = start + 1; i <= 9; ++i)
		ret += Comb(N + 1, i, s - start);
	return ret;
}

int main(){

	vector<int> RET;
	while (cin >> n >> s && (n != 0 || s != 0))
	{
		int ret = 0;
		for (int i = 0; i <= 9; ++i)
			ret += Comb(1, i, s);
		RET.push_back(ret);
	}
	for (int i = 0; i < RET.size(); i++) {
		cout << RET[i] << endl;
	}
	return 0;
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

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

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  string str;

  getline(cin, str);


  REP(i, str.size()) {
    if(str[i] >= 'a' && str[i] <= 'z') cout << (char)(str[i]+('A'-'a'));
    else cout << str[i];
  }
  cout << 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]-=32;
	}

	cout<<str<<endl;
	return 0;
}

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(str[i] == '.'){
      str2[i] = '.';
    }else if(str[i] == ' '){
      str2[i] = ' ';
    }else if(str[i] == '\n'){
      break;
    }else{
      str2[i] = str[i] - 'a' + 65;
    }

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

  return 0;
}