#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
using namespace std;
const int maxn = 100100;
map<int, int> up, down;
ll tree[2*4*maxn];
int upmax, downmax, n;
int dp[maxn];
struct trapez {
public:
int a, b, c, d;
} arr[maxn];
void update(int ux, ll value, int li=0, int ri=downmax, int index=1) {
if(li==ri) tree[index] += value;
else {
int mid = (li+ri)/2;
if(ux <= mid) update(ux, value, li, mid, 2*index);
else if(ux > mid) update(ux, value, mid+1, ri, 2*index+1);
tree[index] = max(tree[2*index],tree[2*index+1]);
}
}
ll query(int ql, int qr, int li=0, int ri=downmax, int index=1) {
if(li > qr || ri < ql) return 0LL;
else if(li >= ql && ri <= qr) return tree[index];
else {
int mid = (li+ri)/2;
return max(query(ql,qr,li,mid,2*index), query(ql,qr,mid+1,ri,2*index+1));
}
}
vector<pair<int, bool> > events[2*maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=0;i<n;i++) {
cin>>arr[i].a>>arr[i].b>>arr[i].c>>arr[i].d;
up[arr[i].a] = 1;
up[arr[i].b] = 1;
down[arr[i].c] = 1;
down[arr[i].d] = 1;
}
upmax = downmax = 1;
for(auto i:up) {
up[i.first] = upmax++;
}
for(auto i:down) {
down[i.first] = downmax++;
}
for(int i=0;i<n;i++) {
arr[i].a = up[arr[i].a];
arr[i].b = up[arr[i].b];
arr[i].c = down[arr[i].c];
arr[i].d = down[arr[i].d];
events[arr[i].a].push_back(make_pair(i, true));
events[arr[i].b].push_back(make_pair(i, false));
}
int result = 0;
for(int i=1;i<=upmax;i++) {
for(auto j:events[i]) {
if(j.second) {
dp[j.first] = query(0, arr[j.first].c) + 1;
result = max(result, dp[j.first]);
}
else update(arr[j.first].d, dp[j.first]);
}
}
cout<<result<<" 0\n";
return 0;
}
