#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define rep(i, s, t) for(i = s; i <= t; ++i)
#define dep(i, s, t) for(i = s; i >= t; --i)

using namespace std;

const double Pi = acos(-1.);
const int N = 110;
int n;
struct D{double x, y, f;} d[N], e[N];
double ans[N];

bool cmp(D a, D b) {return a.f < b.f;}

int main() {
	int i, j, m; D key;
	scanf("%d", &n);
	rep(i, 1, n) scanf("%lf%lf", &d[i].x, &d[i].y);
	rep(i, 1, n) {
		key = d[i];
		
		m = 0;
		rep(j, 1, n)
			if(i != j) {e[++m] = d[j]; e[m].f = atan2(e[m].y-key.y, e[m].x-key.x);}
		sort(e+1, e+m+1, cmp);
		rep(j, 1, m-1)
			if(e[j+1].f - e[j].f > Pi) ans[i] = (e[j+1].f - e[j].f - Pi) / Pi / 2.;
		if(e[1].f + Pi + Pi - e[m].f > Pi) ans[i] = (e[1].f + Pi - e[m].f) / Pi / 2.;
		printf("%.7lf\n", ans[i]);
	}
	return 0;
}
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
    int N;
    cin>>N;
    vector<pair<int, int> > red(N), blue(N);
    int a, b;
    rep(i, N){
        cin>>a>>b;
        red[i] = mp(a, b);
    }
    rep(i, N){
        cin>>a>>b;
        blue[i] = mp(a, b);
    }
    sort(red.begin(), red.end(), greater<pair<int, int> >());
    map<int, int> amap;
    int index;
    int tmp;
    int ans = 0;
    for(int i=0;i<N;++i){
        index = -1;
        tmp = -1;
        for(int j=0;j<N;++j){
            if((red[i].fi<blue[j].fi) && (red[i].se<blue[j].se)){
                if(((index==-1) || (tmp > blue[j].se)) && (amap[j]==0)){
                    index = j;
                    tmp = blue[j].se;
                }
            }
        }
        if(index != -1){
            amap[index]++;
            ans++;
        }
    }
    cout<<ans<<endl;
}

