Go: package main

import (
        "fmt"
        "bufio"
        "os"
        "strings"
)

func main() {
        var s string
        sc := bufio.NewScanner(os.Stdin)
        sc.Scan()
        s = sc.Text()
        fmt.Println(strings.ToUpper(s))
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }


struct ToUpper {
    char operator()(char c) { return toupper(c); }
};

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

	transform(ALL(str), str.begin(), ToUpper());

	cout << str << endl;
}

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

using namespace std;

int main() {

	string s;

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


	return 0;

}

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

using namespace std;

int main() {

	string st;

	while (getline(cin, st)) {
		transform(st.begin(), st.end(), st.begin(), toupper);

		cout << st << endl;
	}


	return 0;
}

C++: #define _USE_MATH_DEFINES

#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

using namespace std;

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

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

	cout << s << endl;
}

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

using namespace std;

void solve()
{
	string str;
	getline(cin, str);
	for(int i = 0; i < str.size(); ++i)
	{
		printf("%c", toupper(str[i]));
	}
	cout << endl;
}

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

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

using namespace std;

int main(void)
{
	string str;
	getline(cin, str);

	for(char& c : str){
		if(c >= 'a' && c <= 'z'){
			c += 'A' - 'a';
		}
	}


	cout << str << endl;


	return 0;
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
    int i,n;
    string a;
    getline(cin,a);
    for(i=0; i<a.size(); i++){
             if(a[i]!='.')
             a[i]=a[i]-32;    
    }
    cout<< a<<endl;
    return 0;
}

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

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

int main(){
	string s;

	getline( cin, s );

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

	cout << s << endl;

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int size = 1000;
char text[1000];

int main() {

	gets(text);

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

	cout << text << endl;

	return 0;
}

/*@@@@@@@@@@@@@@@@@@@@@@@@@*/
/*@                       @*/
/*@ debug output erased ? @*/
/*@                       @*/
/*@@@@@@@@@@@@@@@@@@@@@@@@@*/

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

C++: #include<iostream>
#include<string>
using namespace std;
int cha(char a){
	char c='A';
	for(char b='a';b<='z';b++){
		if(a==b)return c;
		c++;
	}
	return a;
}
int main(){
	string a;
	int i=0,j=0,k=0,t=0;
	char b[100];
	while(cin>>a){
		t=a.size();
		for(k=0;k<t;k++){
			b[i]=cha(a[k]);
			i++;
		}
		b[i]=' ';
		i++;
	}
	for(j=0;j<i;j++){
		cout<<b[j];
	}
	cout<<endl;
}

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

int main() {
	ios :: sync_with_stdio(false);
	string s;
	getline(cin, s);
	for(char &c : s)
		c = toupper(c);
	cout << s << '\n';
	return 0;
}

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

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

C++: #include <bits/stdc++.h>
#include <vector>
using namespace std;
string x;
int h;
int main(){
	getline(cin, x);
	for(int i = 0; i < x.length(); i++){
		h = (int)x[i];
		if(h >= 97 && h <= 122){
			h = h - 32;
			cout << char(h);
		}
		else
			cout << x[i];
	}
	cout << "\n";
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;

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

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

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

C++: #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
	string str ;
	int i , j , k ;
	getline( cin , str );
	for( i=0 ; i<str.size() ; i++ ){
		if( !islower( str[i] ) )
			str[i]= tolower( str[i] );
		if( !isupper( str[i] ) )
			str[i] = toupper( str[i] );
		cout << str[i];
	}
	cout << endl;
}

C++: #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<stack>
#include<cmath>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)


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

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

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