Race

아직 제출이 없습니다시간 제한2초메모리 제한512 MB

문제

The race for nn sportsmen is organized at a stadium. The sportsmen are running along nn linear tracks of the stadium. Let us consider each track to be a horizontal line, the ii-th track is a line y=iy = i.

The sportsman ii starts running at a point (s_i,i)(s\_i, i) and runs to the right with the speed of v_iv\_i. The race is long, so let us consider that it never ends, and the sportsmen never stop.

Young photographer Daniel is watching the race. He wonders what is the maximum number of sportsmen that would at some moment be on the same straight line. Help him find that out!

입력

Tha first line of input contains an integer nn --- the number of race participants (1n3001 \le n \le 300).

The following nn lines describe sportsmen, the ii-th of them contains two integers s_is\_i and v_iv\_i --- the initial xx-coordinate of the ii-th sportsman and her speed (106s_i106-10^6 \le s\_i \le 10^6; 1v_i1061 \le v\_i \le 10^6).

출력

Output one integer --- the maximum number of sportsmen that would be on the same straight line during the race.