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 <string>
#include <cctype>
using namespace std;
int main(){
	string str;
	int k=0;
	while(cin>>str){
		//if(k!=0) cout<<" ";
		for(int i=0;i<str.length();i++){
			if(isalpha(str[i]))
				str[i] = toupper(str[i]);
		}
		cout<<str;
		k++;
	}
	cout<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int c;
	while(c=getc(stdin)){
		putc((c>='a' and c<='z')?c+'A'-'a':c,stdout);
	}
         return 0;
}

C++: #include <iostream>
#include <ctype.h>
using namespace std;
void str_toupper(char *str)
{
	do{
		*str = toupper(*str);
	}while(*str++);
}
int main(void)
{
	char str[10000];
	fgets(str,sizeof(str),stdin);
	str_toupper(str);
	cout << str << endl;
	return 0;
}

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

using namespace std;

int main()
{
	char ch;
	while (std::cin.get(ch)) {
		ch = std::toupper(ch);
		std::cout << ch;
	}
	std::cout << std::endl;

	return 0;
}

C++: #include<iostream>
#include<ctype.h>
using namespace std;
int main(){
    char c;
    while(cin>>c)
    {
        c=toupper(c);
        cout<<c<<endl;
    }
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<ctype.h>

using namespace std;

int main(void)
{
  char str[1000]={};
  int i;
  int len;

  gets(str);
  len=strlen(str);

  for(i=0;i<len;i++)
    str[i]=toupper(str[i]);

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

return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <functional>
using namespace std;

int main() {
	char str[100];
	scanf("%[a-z .]",str);
	for(int i = 0; str[i]; i++) {
		if('a' <= str[i] && str[i] <= 'z') str[i]+='A'-'a';
	}
	printf("%s\n",str);
	return 0;
}

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


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

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<cfloat>
#include<cassert>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define EPS (1e-10)
using namespace std;

typedef unsigned int uint;
typedef long long ll;
typedef complex<double> P;

#define PI (3.1415926535)
#define EPS (1e-10)

int main(){
  string str;
  while(getline(cin,str)){
    FOR(it,str) if(islower(*it)) *it=toupper(*it);
    cout << str << endl;
  }
  return 0;
}

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

using namespace std;

int main()
{
	int i = 0;
	string str;

	getline(cin, str);

	while(str[i] != 0){
		if(str[i] >= 97 && str[i] <= 122){
			str[i] -= 32;
			cout << str[i];
		}
		else
			cout << str[i];
		i++;
	}

	cout << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int c;
	while((c=getc(stdin))!='\n'){
		putc((c>='a' and c<='z')?c+'A'-'a':c,stdout);
	}
	return 0;
}

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

using namespace std;

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

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

using namespace std;

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

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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi  i <= _##i poi  i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi  i < _##i poi  i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi  i >= _##i poi  i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi  i > _##i poi  i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

/*#define do {*/
/*#define end }*/

#define val const auto
#define var auto

#define zenbu(c) c.begin(), c.end()

#define fuwafuwa(n, c) dokidoki((n) + (c) - 1, c)
#define dokidoki(n, c) ((n) / (c) * (c))

template<class T> bool read(T& t){
    return cin >> t poi
}
template<class T, class...U> bool read(T& t, U&... u){
    unless(cin >> t) return false poi
    return read(u...) poi
}

int main(){
    char S[10000] poi
    cin.getline(S, 10000) poi
    string s = S poi
    for(char& c : s){
        c = toupper(c) poi
    }
    cout << s poipoi poi

    return 0 poi
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	char v[200];
	fgets(v, 200, stdin);
	REP(i, 0, strlen(v)) {
		
		if(92<=v[i] && v[i]<=118) v[i] -= 'a' - 'A';
		cout << v[i];
	}
	


	return 0;
}

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

int main(void){
	char buff[8192];
	char *p;

	scanf("%s",buff);
	p=buff;
	while(*p!='\0'){
		*p=toupper(*p);
		p++;
	}
	printf("%s\n",buff);
}

C++: #include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <map>
#define INF 100000000

using namespace std;
typedef long long ll;

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

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;
int main()
{
     string s;
     while(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<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
int main(){
    string s;
        getline(cin,s);
        for(int i=0;s[i]!='\0';i++){
            if(s[i]>='a'&&s[i]<='z')    s[i]-=32;
        }
        for(int i=0;s[i]!='\0';i++){
            cout << s[i];
        }
        cout << '\0';
    return 0;
}

C++: #include<iostream>
#include<string>
int main()
{
	std::string str;
	std::getline(std::cin, str);
	for (auto&i : str)
	{
		if ('a' <= i && i <= 'z')
		{
			i += 'A' - 'a';
		}
	}
	std::cout << str << std::endl;
	return 0;
}