#include using namespace std; //#pragma GCC optimize ("-O3") using ll = long long; const char alphabet[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'}; const ll MOD = (ll) 1e9 + 7; const int MAX_INT = 1 << 17; const ll INFL = 1LL << 60; const ll MAX_V = 1010; const ll MAX_E = 2010; ll V, E; struct edge { ll from, to, cost; }; edge ES[MAX_E]; ll d[MAX_V]; #define ALL(obj) (obj).begin(),(obj).end() #define RALL(obj) (obj).rbegin(),(obj).rend() #define PRINT(n) cout << n << "\n"; #define PRINT2(n, m) cout << n << " " << m << " "<< "\n"; // REP(i,n) -- 0 - n-1 ++ #define REP(i,n) for(int i=0;i<(int)n;++i) // RREP(i,n) -- n-1 - 0 -- #define RREP(i,n) for(int i =(int)n;i>0;--i) // rep(i,a,b) -- a - b ++ #define rep(i,a,b) for(int i=a;i<=b;i++) // rrep(i,a,b)-- a - b -- #define rrep(i,a,b) for(int i=a;i>=b;i--) // 0 - 2^(n-1) #define REPbit(bit, n) for(int bit = 0; bit < (int)(1<> s; string t; for(char x : s) t += (islower(x) == 0 ? tolower(x) : toupper(x)); PRINT(t) }