Print a sequence of numbers starting with N, ** without using loop**, in which A[i+1] = A[i] - 5, if A[i]>0, else A[i+1]=A[i] + 5 repeat it until A[i]=N.

**Input:**

First line contains number of test cases T. Then following T lines contains an integer N.

**Output:**

Single line with pattern **.**** **

**Constraints:**

0< N < 10000

**Example:**

*Input:*

2

16

10

*Output: *

16 11 6 1 -4 1 6 11 16

10 5 0 5 10

*Explanation:*

We basically first reduce 5 one by one until we reach a negative or 0. After we reach 0 or negative, we one by one add 5 until we reach N.

just_kiddin | 48 |

Paras Chadha | 47 |

chaitanyaanimesh | 46 |

Jihye Sofia Seo | 44 |

Anshu Ahirwar | 44 |

gameghost07 | 488 |

xyz2017 | 460 |

N NAGA SAI KRISHNA | 445 |

Anshu Ahirwar | 419 |

Divyasri | 408 |

akhayrutdinov | 3371 |

sanjay05 | 3239 |

Jasleen Kaur 2 | 2012 |

Elite Coder | 1803 |

Michael Riegger | 1788 |