func_code_string: #include <bits/stdc++.h>   const int inf = (1ll << 30) - 1;   const int maxn = (int)1e5 + 10;   const int mod = (int)1e9 + 7;   using namespace std;   void solve() {     string second;     cin >> second;     sort(second.begin(), second.end());     int cnt = 0;     vector<string> v;     string x =   ;     x += second[0];     for (int i = 1; i < second.size(); i++) {       if (second[i] != second[i - 1]) {         v.push_back(x);         x =   ;       }       x += second[i];     }     v.push_back(x);     if (v.size() == 1) {       cout << second <<   n ;       return;     }     string A =   ;     if (v.size() > 3) {       A = v[2] + v[0] + v[3] + v[1];       for (int i = 4; i < v.size(); i++) {         if (i % 2 == 0)           A += v[i];         else           A = v[i] + A;       }       cout << A <<   n ;       return;     }     if (v.size() == 2) {       if (v[1][0] - v[0][0] == 1) {         cout <<  No answer n ;         return;       }       cout << second <<   n ;       return;     }     if (v[1][0] - v[0][0] == 1 && v[2][0] - v[1][0] == 1) {       cout <<  No answer n ;       return;     }     if (v[1][0] - v[0][0] != 1 && v[2][0] - v[1][0] != 1) {       cout << second <<   n ;       return;     }     if (v[1][0] - v[0][0] == 1)       cout << v[0] << v[2] << v[1] <<   n ;     else       cout << v[1] << v[0] << v[2] <<   n ;   }   int main() {     int t = 1;     scanf( %d , &t);     for (int i = 1; i <= t; i++) {       solve();     }     return 0;   }   