**Compilation/Execution Result:**

For a given non-negative integer N, find the next smallest Happy Number. A number is called happy if it leads to 1 after a sequence of steps where in each step number is replaced by sum of squares of its digit that is if we start with Happy Number and keep replacing it with digits square sum, we reach 1.

**Input:**

First line of input is an integer T, denoting the number of test cases. For each test case, there is one line of input consisting of an integer N, whose next smallest happy number has to be found.

**Output:**

The only line of output for each test case consists of the next smallest happy number for the given number N. If the integer N, is a happy number itself, then too, it's next smallest happy number should be printed as output.

**Constraints:**

0<=T<=200

0<=N<1000

**Example:**

**Input:**

4

8

3

0

10

**Output:**

10

7

1

13

**Explanation:**

The next smallest happy numbers for the numbers 8,3 and 0 are 10,7 and 1 respectively. For 10 which is a happy number itself, therefore it's next smallest happy number is 13.

Pulkit Gupta 2 | 114 |

nancygarg258_pec | 90 |

Little Noah | 84 |

rs119574 | 82 |

Relentless | 81 |

Ibrahim Nash | 580 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 333 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3140 |

Quandray | 3028 |

Michael Riegger | 2359 |