Given an integer ‘n’, generate the first ‘n’ terms of the Connell Sequence.

**Connell Sequence** is the sequence formed with the first odd number, i.e 1 as its first term. The subsequent terms of the sequence are made up of the first two even numbers, i.e 2 and 4, followed by the next three odd numbers, i.e 5, 7 and 9, followed by the next four even numbers, i.e 10, 12, 14 and 16 and so on …. the sequence continues.

**Input:**

The first line contains an integer **T**, the number of test cases. For each test case, there is an integer **n.**

**Output:**

For each test case, the output is a Connell Sequence containing **n** terms.

**Constraints:**

1<=T<=100

1<=n<=10^5

**Example:
Input**

2

6

12

1 2 4 5 7 9

1 2 4 5 7 9 10 12 14 16 17 19

Author: Vanshika_pec

bro_C_code | 91 |

Vittorino92 | 89 |

an0nym0u5 | 81 |

Palash Jain 2 | 67 |

SeungminLee | 66 |

Ibrahim Nash | 399 |

blueberry | 315 |

xiaowang | 306 |

rutvikpatel29 | 250 |

sushanto | 244 |

akhayrutdinov | 4866 |

Quandray | 4236 |

Ibrahim Nash | 4063 |

sanjay05 | 3668 |

GB11 | 2857 |