Algorithm


A. George and Accommodation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.

George and Alex want to live in the same room. The dormitory has n rooms in total. At the moment the i-th room has pi people living in it and the room can accommodate qi people in total (pi ≤ qi). Your task is to count how many rooms has free place for both George and Alex.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of rooms.

The i-th of the next n lines contains two integers pi and qi (0 ≤ pi ≤ qi ≤ 100) — the number of people who already live in the i-th room and the room's capacity.

Output

Print a single integer — the number of rooms where George and Alex can move in.

Examples
input
Copy
3
1 1
2 2
3 3
output
Copy
0
input
Copy
3
1 10
0 10
10 10
output
Copy
2

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<iostream>
using namespace std;

int main(){
  int n, p, q, count = 0;
  cin>>n;
  for(int i = 0; i < n; i++){
    cin>>p;
    cin>>q;
    if(q - p <= 2){
      count++;
    }
  }
  cout<<count;
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
3
1 1
2 2
3 3
Advertisements

Demonstration


Codeforcess Solution 467-A A. George and Accommodation ,C++, Java, Js and Python ,467-A,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+