#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> OST;
const ll NMAX = 300001;
const ll INF = (1LL << 60);
const ll HALF = (1LL << 59);
const ll MOD = 30013;
const ll BLOCK = 318;
const ll base = 31;
const ll nr_of_bits = 21;
class All{
public:
pii all[4 * NMAX];
pii combine(pii a, pii b){
if(a.first > b.first)
return a;
if(a.first < b.first)
return b;
return {a.first, (a.second + b.second) % MOD};
}
void update(ll node, ll st, ll dr, ll a, pii b){
if(st == dr){
b.second %= MOD;
all[node] = b;
return;
}
ll mid = (st + dr) / 2;
if(a <= mid){
update(node * 2, st, mid, a, b);
}else{
update(node * 2 + 1, mid + 1, dr, a, b);
}
all[node] = combine(all[node * 2], all[node * 2 + 1]);
}
pii query(ll node, ll st, ll dr, ll a, ll b){
if(a <= st && dr <= b){
return all[node];
}
ll mid = (st + dr) / 2;
pii rez = {-1, 0};
if(a <= mid){
rez = combine(rez, query(node * 2, st, mid, a, b));
}
if(b > mid){
rez = combine(rez, query(node * 2 + 1, mid + 1, dr, a, b));
}
return rez;
}
void set(ll a, pii b){
update(1, 1, NMAX - 1, a, b);
}
pii prefix(ll x){
return query(1, 1, NMAX - 1, 1, x); ///sa evit 0
}
}st;
struct ura{
ll a, b, c, d;
};
bool cmp(ura a, ura b){
return a.a < b.a;
}
pii dp[300001];
ura v[300001];
vector <ll> nrm;
map <ll, ll> mp;
int main() {
ll n, i;
cin >> n;
for(i = 1; i <= n; i++){
cin >> v[i].a >> v[i].b >> v[i].c >> v[i].d;
nrm.push_back(v[i].a);
nrm.push_back(v[i].b);
}
///normalizare
ll cnt = 0;
sort(nrm.begin(), nrm.end());
for(i = 0; i < nrm.size(); i++){
if(i == 0 || nrm[i] != nrm[i - 1])
cnt++;
mp[nrm[i]] = cnt;
}
nrm.clear();
for(i = 1; i <= n; i++){
v[i].a = mp[v[i].a];
v[i].b = mp[v[i].b];
nrm.push_back(v[i].c);
nrm.push_back(v[i].d);
}
mp.clear();
sort(nrm.begin(), nrm.end());
for(i = 0; i < nrm.size(); i++){
if(i == 0 || nrm[i] != nrm[i - 1])
cnt++;
mp[nrm[i]] = cnt;
}
nrm.clear();
for(i = 1; i <= n; i++){
v[i].c = mp[v[i].c];
v[i].d = mp[v[i].d];
}
mp.clear();
///gata
sort(v + 1, v + n + 1, cmp);
priority_queue <pii> pq; ///daca sortez dupa b, scot logul
pii sol = {0, 0};
st.set(1, {0, 1});
for(i = 1; i <= n; i++){
while(pq.size() && (-pq.top().first) <= v[i].a){
st.set(v[pq.top().second].d, dp[pq.top().second]);
pq.pop();
}
dp[i] = st.prefix(v[i].c);
dp[i].first++;
pq.push({-v[i].b, i});
sol = st.combine(sol, dp[i]);
}
cout << sol.first << " " << sol.second << "\n";
return 0;
}
