// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx,avx2")
// #pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "0\n"; return;}
const int MODE = 676767677;
using namespace std;
struct trio
{
ll sx, sy, ex, ey;
bool operator<(const trio &q) {
if (sx != q.sx) return sx < q.sx;
return sy < q.sy;
}
};
void solve(int tc) {
ll n;
cin >> n;
vector<trio> X;
for (int i = 0; i < n; i++)
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
X.emplace_back(trio({a, c, b, d}));
}
vector<pair<pl, pl>> dp;
pl sol = {0, 1};
auto mrg = [&](pl a, pl b) -> pl {
if (a.first > b.first) return a;
if (a.first < b.first) return b;
a.second = (a.second + b.second) % MODE;
return a;
};
sortx(X);
for (auto t : X) {
pl mx = {1, 1};
for (auto p : dp) {
if (p.first.first <= t.sx && p.first.second <= t.sy) {
pl re = p.second; re.first++;
mx = mrg(mx, re);
}
}
sol = mrg(sol, mx);
dp.push_back({{t.ex, t.ey}, mx});
}
cout << sol.first << ' ' << sol.second << '\n';
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int size = 1;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
// cin >> size;
for (int i = 1; i <= size; i++) solve(i);
}
