**Compilation/Execution Result:**

Given an **odd number** in the form of string, the task is to make largest even number possible from the given number provided one is allowed to do only one swap operation, if no such number is possible then print the input string itself.

Examples:

```
Input : 1235785
Output :1535782
Swap 2 and 5.
```

**Input:**

Thr first line of the input contains a single integer **T**, denoting the number of test cases. Then **T** test case follows, the only line of the input contains an odd number in the form of string.

**Output:**

For each test case print the largest possible even number that could be formed by using one swap operation only.

**Constraints:**

1<=T<=100

1<=N<=10^{6}

**Example:
Input:**

3

789

536425

1356425

798

536524

1356524

Shashank_Pathak | 200 |

surbhi_7 | 168 |

yati493 | 167 |

SANJAY5797 | 164 |

dark_knights | 162 |

surbhi_7 | 556 |

Shashank_Pathak | 556 |

dark_knights | 501 |

Infinty | 341 |

Vasudha Gupta | 308 |

akhayrutdinov | 4156 |

sanjay05 | 3597 |

Quandray | 2778 |

Ibrahim Nash | 2475 |

Michael Riegger | 2280 |