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.
Example 1:
Input: N = 10
Output: 2
Explanation: The 2 ways to split 
the stick are {1,1,4,4} , {2,2,3,3} 
Ã¢â¬â¹Example 2:
Input: n = 20
Output: 4
Explanation: 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.
Your Task:  
You don't need to read input or print anything. Your task is to complete the function count() which takes N as input and returns the answer.
Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)
Constraints:
1 ≤ N ≤ 10^{9}

Source: geeksforgeeks | Difficulty: EASY
Tags: Mathematics

Starter code: #User function Template for python3



class Solution:

    def count (self, N):

        #complete the function here

Solutions:
class Solution:

	def count(self, N):
		if N & 1:
			return 0
		n = N // 2
		if n & 1:
			return n // 2
		return n // 2 - 1


class Solution:

	def count(self, N):
		if N % 2 == 1 or N <= 4:
			return 0
		else:
			k = int(N / 2 // 2)
			if N == k * 4:
				return k - 1
			return k
if __name__ == '__main__':
	t = int(input())
	for _ in range(t):
		n = int(input())
		ob = Solution()
		print(ob.count(n))


class Solution:

	def count(self, N):
		if N % 2 == 1:
			return 0
		l = []
		h = N // 2
		if h % 2 == 1:
			return h // 2
		else:
			return h // 2 - 1


class Solution:

	def count(self, N):
		if N % 2 == 1:
			return 0
		count = N // 4
		if N % 4 == 0:
			count -= 1
		return count