#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int mod = 1e9 + 7, inf = 1e17;
struct node { int mx, cnt; };
node merge(node left, node right) {
if (left.mx > right.mx) return left;
if (right.mx > left.mx) return right;
return {left.mx, (left.cnt + right.cnt) % mod};
}
struct segment_tree {
int n;
vector<node> t;
segment_tree(int n) : n(n), t(n << 2) {}
void update(int i, int dp, int cn, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (l == r) t[v] = merge(t[v], {dp, cn});
else {
int m = (l + r) >> 1;
if (i <= m) update(i, dp, cn, v << 1, l, m);
else update(i, dp, cn, v << 1 | 1, m + 1, r);
t[v] = merge(t[v << 1], t[v << 1 | 1]);
}
}
node get(int L, int R, int v = 1, int l = 0, int r = -1) {
if (L > R) return {0, 0};
if (r < 0) r += n;
if (L <= l && r <= R) return t[v];
int m = (l + r) >> 1;
if (R <= m) return get(L, R, v << 1, l, m);
if (L > m) return get(L, R, v << 1 | 1, m + 1, r);
return merge(get(L, R, v << 1, l, m), get(L, R, v << 1 | 1, m + 1, r));
}
};
int32_t main() {
#ifdef JahonaliX
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n;
vector<int> a(n), b;
for (int &i : a) cin >> i;
b = a;
reverse(a.begin(), a.end());
for (int i = 1; i < n; ++i) a.emplace_back(b[i]);
sort(b.begin(), b.end()), b.erase(unique(b.begin(), b.end()), b.end()), m = b.size();
for (int &i : a) i = lower_bound(b.begin(), b.end(), i) - b.begin();
segment_tree s(m);
n = n * 2 - 1;
vector<int> dp(n, 1), cnt(n, 1);
for (int i = 0; i < n; ++i) {
auto p = s.get(0, a[i] - 1);
if (p.mx == 0) {
s.update(a[i], dp[i] + 1, cnt[i]);
continue;
}
dp[i] = p.mx, cnt[i] = p.cnt;
s.update(a[i], dp[i] + 1, cnt[i]);
}
int ans = 0, cn = 0;
for (int i = n / 2 + 1; i < n; ++i) {
if (dp[i] > ans) ans = dp[i], cn = cnt[i];
else cn += cnt[i], cn %= mod;
}
n++, n /= 2;
for (int i = ans; i < n; ++i) cn *= 2, cn %= mod;
cout << ans << ' ' << cn;
return 0;
}
