// File A.cpp created on 06.09.2025 at 23:23:28
#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
#define debug(...) void(23)
#endif
template<typename T>
T power(T& a, i64 b) {
T res {1};
while (b) {
if (b & 1) {
res *= a;
}
a *= a;
b >>= 1;
}
return res;
}
constexpr int md = 30013;
struct MInt {
int val;
MInt() : val(0) {}
template<typename T>
MInt(T x) {
if (-md <= x && x < md) {
val = x;
} else {
val = x % md;
}
if (val < 0) {
val += md;
}
}
int operator()() { return val; }
MInt& operator+= (MInt rhs) {
if ((val += rhs.val) >= md) {
val -= md;
}
return *this;
}
MInt& operator-= (MInt rhs) {
if ((val -= rhs.val) < 0) {
val += md;
}
return *this;
}
MInt& operator*= (MInt rhs) {
val = int(1LL * val * rhs.val % md);
return *this;
}
MInt inv() {
return power(*this, md - 2);
}
MInt& operator/= (MInt rhs) {
return *this *= rhs.inv();
}
bool operator== (MInt rhs) const {
return val == rhs.val;
}
bool operator!= (MInt rhs) const {
return val != rhs.val;
}
};
MInt operator+ (MInt lhs, MInt rhs) {
return lhs += rhs;
}
MInt operator- (MInt lhs, MInt rhs) {
return lhs -= rhs;
}
MInt operator* (MInt lhs, MInt rhs) {
return lhs *= rhs;
}
MInt operator/ (MInt lhs, MInt rhs) {
return lhs /= rhs;
}
std::ostream& operator<< (std::ostream& os, MInt x) {
return os << x.val;
}
std::string to_string(MInt x) {
return to_string(x.val);
}
using Z = MInt;
constexpr int inf = int(1E9) + 5;
struct node {
int f;
Z g;
node() : f(-1), g(1) {}
node(int x, Z y) : f(x), g(y) {}
};
node operator+ (node lhs, node rhs) {
node res;
if (lhs.f > rhs.f) {
res = lhs;
} else if (lhs.f < rhs.f) {
res = rhs;
} else {
res = lhs;
res.g += rhs.g;
}
return res;
}
#define def int mid = (l + r) >> 1, lv = v + 1, rv = v + ((mid - l + 1) << 1)
struct segtree {
int n;
std::vector<node> tree;
segtree(int n_) : n(n_), tree(n << 1) {}
void modify(int v, int l, int r, int p, int f, Z g) {
if (l == r) {
tree[v] = {f, g};
return;
}
def;
if (p <= mid) {
modify(lv, l, mid, p, f, g);
} else {
modify(rv, mid + 1, r, p, f, g);
}
tree[v] = tree[lv] + tree[rv];
}
void modify(int p, int f, Z g) {
modify(0, 0, n - 1, p, f, g);
}
node get(int v, int l, int r, int ql, int qr) {
if (ql == l && r == qr) {
return tree[v];
}
def;
if (qr <= mid) {
return get(lv, l, mid, ql, qr);
} else if (mid + 1 <= ql) {
return get(rv, mid + 1, r, ql, qr);
} else {
return get(lv, l, mid, ql, mid)
+ get(rv, mid + 1, r, mid + 1, qr);
}
}
node get(int l, int r) {
return get(0, 0, n - 1, l, r);
}
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
std::cin >> N;
std::vector<std::array<int, 4>> A(N + 2);
for (int i = 0; i < N; ++i) {
std::cin >> A[i][0] >> A[i][1] >> A[i][2] >> A[i][3];
}
A[N] = {0, 0, 0, 0};
A[N + 1] = {inf, inf, inf, inf};
N += 2;
std::vector<int> ids;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 4; ++j) {
ids.emplace_back(A[i][j]);
}
}
int n;
std::sort(ids.begin(), ids.end());
ids.resize(n = int(std::unique(ids.begin(), ids.end()) - ids.begin()));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < 4; ++j) {
A[i][j] = int(std::lower_bound(ids.begin(), ids.end(), A[i][j]) - ids.begin());
}
}
std::sort(A.begin(), A.end(), [&](auto lhs, auto rhs) {
return lhs[0] < rhs[0];
});
std::vector<int> f(N);
std::vector<Z> g(N);
f[0] = 0;
g[0] = 1;
segtree seg(n);
seg.modify(0, 0, 1);
std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, std::greater<std::pair<int, int>>> pq;
for (int i = 1; i < N; ++i) {
debug(A[i]);
while (!pq.empty() && pq.top().first < A[i][0]) {
int j = pq.top().second;
pq.pop();
seg.modify(A[j][3], f[j], g[j]);
}
auto nd = seg.get(0, A[i][2]);
f[i] = nd.f + 1;
g[i] = nd.g;
pq.emplace(A[i][1], i);
}
debug(f);
int resf = f[N - 1] - 1;
Z resg = g[N - 1];
std::cout << resf << ' ' << resg << '\n';
return 0;
}
