跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1909. George and Accommodation

  • ID: 1915
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

George and Accommodation

题目描述

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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1485 题。保留原作者与原赛事署名。