Given a positive integer N denoting the length of a stick, return the number of ways to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square.

**Input:**

The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a single positive integer N denoting the length of a stick.

**Output:**

For each test case, output a single line containing the number of ways to form rectangle by splitting given stick.

**Constraints:**

1<=T<=100

1<=N<=10^9

**Example:**

Input :

2

10

20

Output :

2

4

**Explanation:**

In the first example, the 2 ways to split the stick are {1,1,4,4} , {2,2,3,3} .

In the second example, the 4 ways to split the stick are {1,1,9,9} , {2,2,8,8} , {3,3,7,7} and {4,4,6,6}.

Note that {5,5,5,5} forms square so it is not considered.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

KshatriyaYash | 658 |

RuntimeTerror | 446 |

nikhil_sojan | 388 |

cypherr | 384 |

striver119 | 378 |

KshatriyaYash | 1066 |

nikhil_sojan | 972 |

lonecoder | 909 |

mazumderrohit8 | 864 |

SumitSingh27 | 832 |

blackshadows | 5327 |

Ibrahim Nash | 5215 |

akhayrutdinov | 5111 |

mb1973 | 4462 |

Quandray | 4444 |

Login to report an issue on this page.