<jupyter_start><jupyter_text><jupyter_code>a = input()
ls = sorted(list(set(a)))

middle = ''
half = ''
x = 0

for i in ls:
  n = a.count(i)
  if n%2==0:
    half += i* (n//2)
  elif x==1:
    half = 0
    print("NO SOLUTION")
    break;

  else:
    x =1
    middle = i
    half += i* (n//2)

if half !=0:
  print(half+middle+half[::-1])<jupyter_output>Mother
NO SOLUTION
{'fraction_non_alphanumeric': 0.1935483870967742, 'fraction_numerical': 0.026881720430107527, 'mean_word_length': 2.73, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '148044', 'license': 'MIT', 'n_tokens_mistral': 180, 'n_tokens_neox': 170, 'n_words': 40, 'path': 'CSESFI_12_Palindrome_Reorder.ipynb', 'repo_name': 'Md-NazmulHossain/CSESFI', 'size': '372'}