A special sequence is called Harry Potter Sequence.The sequence meets that F[i]+F[i+1]=F[i+2]+F[i+3] for any i>=0.
问题描述：
A special sequence is called Harry Potter Sequence.The sequence meets that F[i]+F[i+1]=F[i+2]+F[i+3] for any i>=0.
In addition,if an integer is positive and odd,we call it Voldemort Integer.
Now comes the problem.If F[0],F[1],F[2] and n is given,how many Voldemort Integers are there from F[0] to F[n-1]?
Input
First line is an integer m,indicating the number of test cases.(m
答
counter没有清0
另外odd是奇数,所以是F[i]%2==1