Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	input := scanner.Text()
	input = strings.ToUpper(input)
	fmt.Println(input)
}

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

int main(){
  string s;
  int dif = 'a' - 'A'; 

  getline( cin,s );

  for( int i=0;i<s.length();i++ ){
    if( 'a'<= s[i] && s[i] <='z' )
      s[i] -= dif;
  }
  cout << s << endl;

  return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<functional>

using namespace std;

char s[210];

int main()
{
	scanf("%[^\n]", s);
	for (int i = 0; i < strlen(s); i++) {
		printf("%c",toupper(s[i]));
	}
	printf("\n");

	
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	char str[256];
	cin.getline(str, sizeof(str));
	for(int i=0; i<sizeof(str); i++) str[i] -= (str[i] < 65) ? 0 : 32;
	printf("%s\n", str);
	
}

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

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

C++: #include <iostream>
#include <cctype>
#include <cstdio>
using namespace std;
int main(){
	char c;
	while(scanf("%c",&c)){
		if(islower(c)) c = toupper(c);
		cout << c;
	}
	cout << endl;
}

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

int main(void) {
  char a[220];
  int i;
  fgets(a, sizeof(a), stdin);
  for(i = 0; i < strlen(a); ++i) {
    if(a[i] >= 'a' && a[i] <= 'z') a[i] += 'A' - 'a';
    printf("%c", a[i]);
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int main() {
	string s; 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(){
	string str;
	
	getline(cin, str);
	
	for(int i = 0; i < str.size(); i++){
		if(str[i] >= 'a' && str[i] <= 'z'){
			str[i] -= 32;
		}
		else if(str[i] >= 'A' && str[i] <= 'Z'){
			str[i] += 32;
		}
	}
	
	cout << str << endl;
	
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
#define cinl(str) getline(cin,(str))
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	string s;
	cinl(s);
	int n='a'-'A';
	for(int i=0;i<s.size();i++){
		int x=s[i]-'a';
		if(x>=0&&x<=26){
			s[i]=s[i]-n;
		}
	}
	cout<<s<<endl;
}

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

int main(){
	string s;

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



}

C++: #include<cstdio>

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

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

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	char c;
	for(;cin>>c;){
		putchar(('a'<=c&&c<='z')?c^=32:c);
	}
	puts("");
	return 0;
}

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

int main(void) {

  char str[100];
  int i;

  fgets(str,sizeof(str),stdin);

  str[strlen(str)-1]='\0';

  for(i=0;i<strlen(str);i++) {

    if(str[i]>=97 && str[i]<=122) str[i]=str[i]-32;

  }

  printf("%s\n",str);

  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 <queue>
#include <iterator>
#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 gcd(int a, int b){
   int tmp;
   while(a%b==0){
      tmp=a%b;
      a=b;
      b=tmp;
   }
}

int lcm(int a,int b){
   return a*b/gcd(a,b);
}

bool prime_number(int n){
   if(n < 2){
      return false;
   }
   else if(n == 2){
      return true;
   }
   if(n % 2 == 0){
      return false;
   }
   for(int i=3;i<=n/i;i+=2){
      if(n % i == 0) return false;
      return true;
   }
}

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

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

int main(){
	string num;
	getline(cin,num);
			for(int i=0;num[i]!='\0';i++){
				if(num[i]>='a'&& num[i]<='z'){
					num[i]+='A'-'a';
				}
			}
		cout << num << "\n";
	
	return 0;
}

C++: #include <iostream>
#include <string>
#include <cstring>
using namespace std;
int main(){
	string str;int count=0;
	while(cin>>str){
		if(count++) cout << ' ' ;
		for(int i=0;i<str.size();i++)
		if(str[i]-'a'>=0 && str[i]-'z'<=0) str[i]=toupper(str[i]);
		cout << str ;
	};
}

C++: #include <cctype>
#include <cstring>
#include <iostream>

using namespace std;

int main()
{
	char S[256];

	cin.getline(S, 256);

	for (int i = 0; i < strlen(S); i++)
	{
		if (islower(S[i]) != 0)
		{
			S[i] = toupper(S[i]);
		}

		cout << S[i];
	}

	cout << endl;

	return 0;
}