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<ctype.h>
using namespace std;
#define rep(i,s,n)for(int i=s;i<n;i++)
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  getline(cin, s);
  for (char &c:s){
    c=toupper(c);
  }
  cout << s << endl;
  return 0;
}

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

int main(){
	char s[10001];
	cin.getline(s,10000);
	int c = strlen(s);
	for(int i=0;i<c;i++)
		if('a' <= s[i] && s[i] <= 'z')
			s[i] += 'A' - 'a';
	cout << s << "\n";
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
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<algorithm>
#include<string>
using namespace std;
int main()
{
	string a;
	getline(cin,a);
	transform(a.begin(), a.end(), a.begin(), toupper);
	cout << a << 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(){
	int c = 0;
	string s;
	getline(cin, s);
	REP(i, s.size()){
		if (s[i] >= 'a'&&s[i] <= 'z'){
			s[i] += 'A' - 'a';
		}
	}
	cout << s << "\n";
}

C++: #include <cstdio>
#include <algorithm>
#include <string>

using namespace std;

int main() {
    char buf[256];
    fgets(buf, 256, stdin);
    string s(buf);

    auto toupper=[](char c)->char {
        if (c >= 'a' && c <= 'z')
            c &= ~0x20;

        return c;
    };

    transform(s.begin(), s.end(), s.begin(), toupper);

    printf("%s", s.c_str());
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
bool isChar(char i){
  if('a'<=i && i <='z')return true;
  return false;
}
int main(void){
  string s;
    rep(i,s.size()){
      if(isChar(s[i])){
	s[i]-=32;
      }
    }
    cout<<s;
  while(cin>>s){
    rep(i,s.size()){
      if(isChar(s[i])){
	s[i]-=32;
      }
    }
    cout<<" "<<s;
  }
  cout<<endl;
}

C++: #include <cstdio>

bool is_alphabet(char data) {
	if ('a' <= data && data <= 'z') {
		return true;
	}
	return false;
}

int main(int argc, char *argv[]) {
	char msg[1000];
	fgets(msg, 500, stdin);
	for (int i = 0; i < 500; i++) {
		if (is_alphabet(msg[i])) {
			msg[i] -= 32;
		}
		if (msg[i] == '\0') {
			break;
		}
	}
	printf("%s\n", msg);
	
	return 0;
}

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

using namespace std;

int main(int argc, char const* argv[])
{
	string target;

	getline( cin, target );

	for( int i = 0;i < target.size();i++ ){
		if( target[i] >= 'a' && target[i] <= 'z' ) target[i] += ('A' - 'a' );
	}

	cout << target << endl;

	return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;
 
struct ToUpper {
    char operator()(char c) { return toupper(c); }
};
 
int main() {
    string st;
    getline(cin, st);
    transform(st.begin(), st.end(), st.begin(), ToUpper());
    cout <<st<< 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;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
int main(){

	string s;
	getline(cin, s);
	rep(i, s.size()){
		if('A' <= s[i] && s[i] <= 'Z') s[i] += 32;
		else 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() {
  int n;
  string str;

  /*  while(cin >> str) {
    n = str.size();
    for(int i=0;i<n;i++) {
      if((str[i] <= 122) && (str[i] >= 97)) {
        str[i] -= 32;
      }
    }
    if(str[n-1] == 46)
      cout << str;
    else
      cout << str << " ";
  }
}
  */
  getline(cin,str);
  n = str.size();
  for(int i=0;i<n;i++) {
    if((str[i] <= 'Z') && (str[i] >= 'A')) {
      str[i] -= 32;
    }
  }
  cout << str << endl;
}

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

int main() {
	string s;
	getline(cin,s);
	for(int i=0;i<s.size();i++){
		if(isalpha(s[i]))
			putchar(toupper(s[i]));
		else putchar(s[i]);
	}cout<<endl;
}

C++: #include <iostream>

int main(int argc, const char * argv[]) {
    std::string line;
    while(getline(std::cin,line)){
        for(int i = 0;i<line.length();i++){
            if ( line[i]>='a' && line[i]<='z'){
                line[i] = line[i] + ('A' - 'a');
            }
        }
        std::cout << line << std::endl;
        
    }
        }

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


int main()
{
char str,ch;
int  n;
while(scanf("%c",&str)!=EOF)
{
ch=toupper(str);
printf("%c",ch);
}
printf("\n");
return 0;
}

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

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

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;
}