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++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	string s;
	getline(cin, s);
	rep(i, SZ(s)) {
		if (islower(s[i])) {
			s[i] = (char)(s[i] - 32);
		}
		else if (isupper(s[i])) {
			s[i] = (char)(s[i] + 32);
		}
	}
	cout << s << endl;
}
/*
97 a
65 A
*/

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
signed main(){
        char buf[256];
        while ( fgets(buf, 256, stdin) != NULL ) {
                string str(buf);
                transform(str.cbegin(), str.cend(), str.begin(), ::toupper);
                cout << str;
        }
        return 0;
}

C++: #include<stdio.h>

int main(){
  char c;

  while(scanf("%c",&c)!=EOF){

  if('a' <= c && c <='z')
    c+=('A'-'a');
  

    printf("%c",c);
  }
  printf("\n");
  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;
      }
    }
    cout << str << endl;
  }
}

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
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] += ('A' - 'a');
    }
  }
  cout << str << endl;
  return (0);
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <map>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdio>
#include <climits>
using namespace std;
#define rep(i,n) for(LL i=0;i<n;i++)
#define all(v)	(v).begin(),(v).end()
#define MOD  1000000007
const int INF = INT_MAX;
typedef long long LL;


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

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

int main(){
	int i;
	char str;
	while(1){
		str = getchar();
		if(str == '\n') break;
		if(str >= 'a' && str <= 'z') str -= 32;
		printf("%c",str);
	}
	printf("\n");
	return 0;
}

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

using namespace std;

int main() {
  vector<string> str(200);

  int i = 0;
  while(cin >> str[i]){
    i++;
  }

  for(int i = 0; i < str.size(); i++) {
    transform(str[i].begin(), str[i].end(), str[i].begin(), ::toupper);
  }

  for(int i = 0; i < str.size(); i++) {
    if(i) { cout << " ";}
    cout << str[i];
  }

  cout << endl;
  return 0;
}

C++: //#define _USE_MATH_DEFINES
//#include <cmath>
#include <iostream>
//#include <stdio.h>
//#include <stdlib.h>
//#include <iomanip>
//#include <vector>
#include <string>
//#include <algorithm>
//#include <functional>
//#include <time.h>
//#include <sstream>
//#include <queue>

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 << 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(;scanf("%c",&c)!=EOF;){
		printf("%c",('a'<=c&&c<='z')?c^32:c);
	}
	return 0;
}

C++: #include<stdio.h>

int main(void)
{
	char s;
	while(s=getchar()!='\n' && s!=EOF)
	{
		if('a'<=s && s<='z')
			s -='a'+'A';
         printf("%s",s);
	}
  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++)
    {
        str[i] = toupper(str[i]);
    }
    cout << str << endl;
    return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int len,i,j;
	char s;
	while(scanf("%c",&s)!=EOF) {
		if('a'<=s && 'z'>=s){
			s=s-('a'-'A');
			printf("%c",s);
		}
		else if(s==' ' || s=='.')	printf("%c",s);
	}
	printf("\n");
	return 0;
}

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

int main()
{
    for (int x; (x = cin.get()) != -1;)
        cout << (char) (islower(x) ? x - 0x20 : x);

    return 0;
}

C++: #include<iostream>
#include<string>
int main(){
	std::string str;
	std::getline(std::cin,str);
	int h=0;
	while(h<str.size()){
		if(str[h]!=' '&&str[h]!='.')str[h]-='a'-'A';
		h++;
	}
	std::cout<<str<<std::endl;

	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()

#define fora(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define ford(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define foraf(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define fordf(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)

#define vcitr vector<int>::iterator
#define vcsitr vector<string>::iterator
#define mapcitr map<char, int>::iterator
#define mapsitr map<string, int>::iterator

typedef long long ll;

int iINF = 2147483647;
ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }

int main() {
	string str;
	int d = 'A' - 'a';
	
	while (getline(cin, str)) {
		for (int i=0; i<(int)str.size(); i++) {
			if (str[i]==' ' || str[i]=='.') continue;
			str[i] += d;
		}
		cout << str << endl;
	}
	
	return 0;
}

C++: #include<stdio.h>
int main(){
  char c;
  while(scanf("%c",&c)){
    if(c==' ') printf(" ");
    else if(c=='.') printf(".");
    else if(c=='\n') printf("\n");
    else printf("%c",c-32);
  }
}

C++: #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	string a;
	cin >> a;
	transform(a.begin(), a.end(), a.begin(), toupper);
	cout << a << endl;
	return 0;
}