Problem hidden

DCP - Fun With Fibonacci

The Fibonacci sequence is a set of numbers that starts with a zero, followed by a one, and proceeds based on the rule that, each number (called a Fibonacci number) is equal to the sum of the previous two numbers. If the Fibonacci sequence is denoted F(n), where n is the term in the sequence,

Fibonacci series

Now your task is to find the total number of odd Fibonacci numbers and total number of even Fibonacci numbers between a range (consider 0 as an even number).

Input

First Line of the input contains T, representing the number of test case (1 ≤ T ≤ 50). For each test case contains two integers N and M where (1 ≤ N ≤ 1018) and (1 ≤ M ≤ 1018).

Output

You have to calculate total number of odd Fibonacci numbers and total number of even Fibonacci numbers between Nth Fibonacci number and Mth Fibonacci number.

For each test case print case number with the desire answer as show sample output.

Example

Input:
2
2 6
1 5

Output:
Case 1:
Odd = 4
Even = 1
Case 2:
Odd = 3
Even = 2

Adicionado por:Sifat
Data:2021-09-25
Tempo limite:1s
Tamanho do fonte:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Linguagem permitida:C NCSHARP CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG GO JAVA JULIA PYTHON PYPY3 PYTHON3
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.