**Compilation/Execution Result:**

60.65%

Given a number N. Write a program to the find number of diagonals possible in N sided convex polygon.

**Input:**

First line of input contains a single integer T which denotes the number of test cases. T test cases follows. First line of each test case contains a single integer N.

**Output:**

For each test case print number of diagonals possible in N sided convex polygon.

**Constraints:**

1<=T<=100

3<N<=10^{4}

**Example:
Input:**

2

5

6

5

9

Author: harsh.agarwal0

surbhi_7 | 219 |

Rajat Thakur 2 | 205 |

Anupam Prakash 1 | 201 |

Ibrahim Nash | 195 |

Vikram Sreenivasa | 171 |

Ibrahim Nash | 709 |

ashrepos | 574 |

shi143din | 438 |

RealHorror | 435 |

HABIB_SHEIKH | 369 |

akhayrutdinov | 4059 |

sanjay05 | 3451 |

Quandray | 2465 |

Michael Riegger | 2232 |

Jasleen Kaur 2 | 2012 |