#include <bits/stdc++.h>
using namespace std; using ii = pair<int,int>; using ll = long long;
void o_o(){ cerr << endl; }
template <class H, class...T> void o_o(H h,T...t) { cerr << ' ' << h; o_o(t...); }
#define debug(...) cerr<<'['<<#__VA_ARGS__<<"]:",o_o(__VA_ARGS__)
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define all(x) (x).begin(), (x).end()
#define size(x) int((x).size())
#define fi first
#define se second
#define Mup(x,y) x = max(x,y)
const int N = 1e5+3;
int n;
pair<ii,ii> t[N];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
vector<int> xs, ys;
rep(i,1,n) {
cin >> t[i].fi.fi >> t[i].se.fi;
cin >> t[i].fi.se >> t[i].se.se;
}
sort(t+1,t+n+1);
int lis[N] {0,}, cnt[N] {0,};
int ans1 = 0, ans2 = 0;
rep(i,1,n) {
lis[i] = 1, cnt[i] = 1;
rep(j,1,n-1) {
if (t[j].se.fi < t[i].fi.fi and t[j].se.se < t[i].fi.se) {
if (lis[i] < lis[j]+1) {
lis[i] = lis[j]+1;
cnt[i] = cnt[j];
} else if (lis[i] == lis[j]+1)
cnt[i] = (cnt[i]+cnt[j])%30013;
}
}
Mup(ans1, lis[i]);
}
rep(i,1,n) if (ans1 == lis[i])
ans2 = (ans2+cnt[i])%30013;
cout << ans1 << ' ' << ans2;
}
