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

#F2925. Supercentral Point

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

Supercentral Point

题目描述

A. Supercentral Point
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,y1),(x2,y2),...,(xn,yn). Let's define neighbors for some fixed point from the given set (x,y):

  • point (x',y') is (x,y)'s right neighbor, if x'>x and y'=y
  • point (x',y') is (x,y)'s left neighbor, if x'<x and y'=y
  • point (x',y') is (x,y)'s lower neighbor, if x'=x and y'<y
  • point (x',y') is (x,y)'s upper neighbor, if x'=x and y'>y

We'll consider point (x,y) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.

Vasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.

Input

The first input line contains the only integer n (1≤n≤200) − the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (|x|,|y|≤1000), all coordinates are integers. The numbers in the line are separated by exactly one space. It is guaranteed that all points are different.

Output

Print the only number − the number of supercentral points of the given set.

Examples
Input
8
1 1
4 2
3 1
1 2
0 2
0 1
1 0
1 3
Output
2
Input
5
0 0
0 1
1 0
0 -1
-1 0
Output
1
Note

In the first sample the supercentral points are only points (1,1) and (1,2).

In the second sample there is one supercental point − point (0,0).


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