#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;
ll dp[N], cnt[N];
struct trapezoid{
int a, b, c, d;
bool operator < (const trapezoid &other){
return min(a, c) < min(other.a, other.c);
}
} trape[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen(file".inp", "r", stdin);
freopen(file".out", "w", stdout);
#endif
int n;
cin >> n;
forr(i, 1, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
trape[i] = {a, b, c, d};
}
sort(trape + 1, trape + n + 1);
forr(i, 1, n) cnt[i] = 1;
forr(i, 1, n){
dp[i] = 1;
forr(j, 1, i - 1){
if (trape[j].b < trape[i].a && trape[j].d < trape[i].c){
if (dp[j] + 1 > dp[i]) {
dp[i] = dp[j] + 1;
cnt[i] = cnt[j];
}
else if (dp[j] + 1 == dp[i]){
cnt[i] += cnt[j];
cnt[i] %= mod;
}
}
}
}
int res1 = 0, res2;
forr(i, 1, n){
if (res1 < dp[i]) res1 = dp[i], res2 = cnt[i];
}
cout << res1 << " " << res2;
return 0;
}
