#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define codefor int test;cin>>test;while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; template istream& operator>>(istream& is, vector& vec) {for(T& x : vec)is >> x;return is;} template ostream& operator<<(ostream& os, const vector& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;} void in(){} template void in(Head& head, Tail&... tail){cin >> head;in(tail...);} void out(){cout << '\n';} templatevoid out(const T& a){cout << a << '\n';} template void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);} const int INF = 1 << 30; const long long INF2 = 1ll << 60; template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(b> s; rs = s; reverse(all(rs)); auto f = [&](string s){ int l = 0, r = s.size() - 1; while(l < r){ if(s[l] != s[r]) return false; l++, r--; } cout << s << '\n'; exit(0); return true; }; int n = s.size(); for(int i = 0; i < n; i++){ bool flag = true; for(int j = 0; i + j < n; j++){ if(s[i + j] != rs[j]){ flag = false; } } string t = s + rs.substr(n - i, i); f(t); } //cout << "-1" << '\n'; }