#include <bits/stdc++.h>
#define forr(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define forf(i, a, b) for (int i = (a); i < (b); i++)
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(), v.end()
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vii vector<pii>
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"
using namespace std;
const int base = 31;
const ll mod = 30013;
const ll oo = 1e18;
const int N = 1e6 + 5;
struct event{
int x, y, type, idx;
bool operator < (const event &other){
if (x == other.x) return y < other.y;
return x < other.x;
}
};
pll st[4 * N];
pll combine(pll a, pll b){
if (a.fi == b.fi) return {a.fi, (a.se + b.se) % mod};
return (a.fi < b.fi ? b : a);
}
void update(int id, int l, int r, int i, pll v){
if (i < l || r < i) return;
if (l == r){
st[id] = combine(st[id], v);
return;
}
int mid = (l + r) >> 1;
update(2 * id, l, mid, i, v), update(2 * id + 1, mid + 1, r, i, v);
st[id] = combine(st[2 * id], st[2 * id + 1]);
}
pll get(int id, int l, int r, int u, int v){
if (v < l || r < u) return {0, 1};
if (u <= l && r <= v) return st[id];
int mid = (l + r) >> 1;
return combine(get(2 * id, l, mid, u, v), get(2 * id + 1, mid + 1, r, u, v));
}
ll dp[N], cnt[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<event> v;
vector<int> nen;
forr(i, 1, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a > b) swap(a, b);
if (c > d) swap(c, d);
v.pb({a, c, 0, i});
v.pb({b, d, 1, i});
nen.pb(c);
nen.pb(d);
}
sort(all(nen));
nen.resize(unique(all(nen)) - nen.begin());
forf(i, 0, v.size()) {
v[i].y = lower_bound(all(nen), v[i].y) - nen.begin() + 1;
}
sort(all(v));
forf(i, 0, v.size()){
if (v[i].type == 0){
pll ans = get(1, 1, 4e5, 1, v[i].y - 1);
int id = v[i].idx;
dp[id] = ans.fi + 1;
if (dp[id] == 1) cnt[id] = 1;
else cnt[id] = ans.se;
}
else {
int id = v[i].idx;
update(1, 1, 4e5, v[i].y, {dp[id], cnt[id]});
}
}
ll maxdp = 0, cntres = 0;
forr(i, 1, n) maxdp = max(maxdp, dp[i]);
forr(i, 1, n) if (dp[i] == maxdp) cntres = (cntres + cnt[i]) % mod;
cout << maxdp << " " << cntres;
return 0;
}
