codeforces problem solve

A. Team

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

http://codeforces.com/contest/231/problem/A

One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will implement a problem if at least two of them are sure about the solution. Otherwise, the friends won't write the problem's solution.

This contest offers n problems to the participants. For each problem we know, which friend is sure about the solution. Help the friends find the number of problems for which they will write a solution.

Input

The first input line contains a single integer n (1 ≤ n ≤ 1000) — the number of problems in the contest. Then n lines contain three integers each, each integer is either 0 or 1. If the first number in the line equals 1, then Petya is sure about the problem's solution, otherwise he isn't sure. The second number shows Vasya's view on the solution, the third number shows Tonya's view. The numbers on the lines are separated by spaces.

Output

Print a single integer — the number of problems the friends will implement on the contest.

Examples

input

Copy

3
1 1 0
1 1 1
1 0 0

output

Copy

2

input

Copy

2
1 0 0
0 1 1

output

Copy

1

Note

In the first sample Petya and Vasya are sure that they know how to solve the first problem and all three of them know how to solve the second problem. That means that they will write solutions for these problems. Only Petya is sure about the solution for the third problem, but that isn't enough, so the friends won't take it.

In the second sample the friends will only implement the second problem, as Vasya and Tonya are sure about the solution.

solve in c by rusul azom sumon

#include<stdio.h>
int main()
{
    int i,n,a,b,c,count=0;
    scanf("%d",&n);
    
    for(i=0;i<n;i++){
    scanf("%d%d%d",&a,&b,&c);
    if(a>0&&b>0||b>0&&c>0||c>0&&a>0){
        count++;
    }
    }
    printf("%d\n",count);

    return 0;

}

A. George and Accommodation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

http://codeforces.com/contest/467/problem/A

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

solve in c by rusul azom sumon:

#include<stdio.h>
int main()
{
    int n,i,d,c=0,a,b;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d%d",&a,&b);
        d=a-b;
        if(d<0){
            d=b-a;
        }
        if(d>=2){
             c++;
        }

    }
    printf("%d",c);
}

Md. Rusul Azom Sumon
 CEO & FOUNDER azomTech