#include using namespace std; using ll = long long; void solve() { string s; cin >> s; bool cap = 1; for (int i = 1; i < s.size(); ++i) { if (islower(s[i])) { cap = 0; break; } } if (cap) { for (int i = 0; i < s.size(); ++i) { if(islower(s[i])) s[i]=toupper(s[i]); else s[i]=tolower(s[i]); } } cout<> TC; // cin.ignore(); while (TC--) solve(); }