28.95%

Given a no N you can perform an operation in it in which you can change a digit 5 to 6 and vice versa. Now your task is to print the sum of the max no and the min no obtained by performing such operations.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test case follow . Each test case contains a number N.

**Output:**

For each test case in a new line print the required sum.

**Constraints:**

1<=T<=100

1<=N<=10000

**Example:
Input:**

2

35

5

71

11

The max no which can be formed is 36 and the min no which can be formed is 35 itself

sum : 36+35 = 71

sum : 5+6 = 11

akhayrutdinov | 30 |

Prateek Gole | 30 |

krushna.sharma | 29 |

StarkMaverick | 28 |

ujjwalgarg | 26 |

Lam Ngoc Pham | 405 |

All Is Well | 399 |

Divvya Sinha | 367 |

Prateek Gole | 347 |

skull tone | 310 |

akhayrutdinov | 3847 |

sanjay05 | 3366 |

Michael Riegger | 2015 |

Jasleen Kaur 2 | 2012 |

Quandray | 1949 |