AKOJ正在加载中...

3082: George and Accommodation

金币值:2 定数:1 时间限制:2.000 s 内存限制:256 M
正确:0 提交:0 正确率:0.00% 命题人:
点赞量:0 收藏量:0 题目类型:程序

题目描述

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 (piqi). 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≤piqi≤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