// Problem: George and Accommodation (467A)
 //
 // George and his friend Alex have joined a university.
 // They want to live together in the same dormitory room.
 //
 // The dormitory has N rooms.
 //
 // Each room has:
 // p = Number of people already living in the room.
 // q = Maximum number of people the room can hold.
 //
 // Your Task:
 // Count how many rooms have enough space for
 // BOTH George and Alex.
 //
 // A room is suitable only if it has at least
 // 2 empty spaces.
 //
 // Input:
 // The first line contains N (1 <= N <= 100).
 //
 // The next N lines contain two integers p and q.
 // 0 <= p <= q <= 100
 //
 // Output:
 // Print the number of rooms that can accommodate
 // both George and Alex.
 //
 // Example 1:
 // Input:
 // 3
 // 1 1
 // 2 2
 // 3 3
 //
 // Output:
 // 0
 //
 // Explanation:
 // All three rooms are full.
 // None has space for two more people.
 //
 // Example 2:
 // Input:
 // 3
 // 1 10
 // 0 10
 // 10 10
 //
 // Output:
 // 2
 //
 // Explanation:
 // Room 1 has 9 empty spaces.
 // Room 2 has 10 empty spaces.
 // Room 3 has 0 empty spaces.
 //
 // Therefore, 2 rooms can accommodate both friends.

#include <iostream>

int main() {
    std::cout << "Hello world!" << std::endl;
    return 0;
}