#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 7;
const int mod = 30013;
const int inf = 1e9;
struct trap{
int a, b, c, d;
trap(){}
trap(int a, int b, int c, int d){
this -> a = a;
this -> b = b;
this -> c = c;
this -> d = d;
}
};
bool cmp(trap lvalue, trap rvalue){
return lvalue.a < rvalue.a;
}
struct fenwick_tree{
pair<int, int> arr[MAXN];
void update(int idx, pair<int, int> val){
for(; idx >= 1; idx -= (idx & -idx)){
if(val.first > arr[idx].first){
arr[idx] = val;
}
else{
if(val.first == arr[idx].first){
arr[idx].second += val.second;
arr[idx].second %= mod;
}
}
}
}
pair<int, int> query(int idx){
pair<int, int> ans = {1, 1};
for(; idx < MAXN; idx += (idx & -idx)){
if(arr[idx].first + 1 > ans.first){
ans = {arr[idx].first + 1, arr[idx].second};
}
else{
if(arr[idx].first + 1 == ans.first){
ans.second += arr[idx].second;
ans.second %= mod;
}
}
}
return ans;
}
};
fenwick_tree f;
pair<int, int> dp[MAXN];
trap t[MAXN];
set<int> st;
map<int, int> mp;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> t[i].a >> t[i].b >> t[i].c >> t[i].d;
st.insert(t[i].c);
st.insert(t[i].d);
}
int cnt = 1;
for(int x: st){
mp[x] = cnt++;
}
t[n] = {inf - 1, inf, n + 1, n + 2};
for(int i = 1; i <= n; i++){
t[i].c = mp[t[i].c];
t[i].d = mp[t[i].d];
}
sort(t, t + n + 1, cmp);
for(int i = 0; i <= n; ++i){
dp[i] = f.query(t[i].d);
f.update(t[i].c, dp[i]);
}
cout << dp[0].first - 1 << " " << dp[0].second << "\n";
return 0;
}
