George and Accommodation

George and Accommodation

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
3
1 1
2 2
3 3
Output
0

Input
3
1 10
0 10
10 10
Output
2

问题链接：https://vjudge.net/problem/CodeForces-467A

问题简述：
第一行输入一个整数n (1n 100)，即房间数。
接下来n行的第i行包含两个整数和qi (0 qi 100)已经住在第i个房间的人 数和房间的容量。

问题分析：
输入n以确定房间数，接着利用while循环，输入每个房间实际人数real和最大容纳人数max，当real<=max-2，则George 和 Alex可以共住的房间数i自增

已AC的c++代码如下：

#include<iostream>
using namespace std;
int main()
{
	int n,real,max,i=0;
	cin >> n;
	while (n--)//房间数
	{
		cin >> real >> max;
		if (real <= max - 2)
			i++;
	}
	cout << i;
}