#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

bool isBig(char c){
  if('A'<=c && c <= 'Z') return true;
  else return false;
}

char tolow(char c){
  return (char)(c+'a'-'A');
}

char toup(char c){
  return (char)(c+'A'-'a');
}

int main(){
  string S; cin >> S;
  int N = sz(S);
  rep(i,N){
    cout << (isBig(S[i])? tolow(S[i]):toup(S[i]));
  }
  cout << endl;
  return 0;
}