You have \(N\) rectangles. A rectangle is golden if the ratio of its sides is in between \([1.6, 1.7]\), both inclusive. Your task is to find the number of golden rectangles.

Input format

• First line: Integer \(N\) denoting the number of rectangles
• Each of the \(N\) following lines: Two integers \(W, H\) denoting the width and height of a rectangle

Output format

• Print the answer in a single line.

Constraints

\(1 \le N \le 10^5\)

\(1 \le W, H \le 10^9\)