#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));
}
};
int binpow(int x, int y) {
if (!y) return 1;
int z = binpow(x, y >> 1);
z = z * z % mod;
if (y & 1) z = z * x % mod;
return z;
}
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, ans = 0, cn = 0;
cin >> n;
vector<int> b(n);
for (int &i : b) cin >> i;
for (int mask = 0; mask < (1 << n); mask += 2) {
vector<int> a, c;
for (int i = 0; i < n; ++i) {
if (mask >> i & 1) c.emplace_back(b[i]);
else a.emplace_back(b[i]);
}
reverse(a.begin(), a.end());
for (int i : c) a.emplace_back(i);
vector<int> dp(n, 1), cnt(n, 1);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (a[j] < a[i]) {
if (dp[i] <= dp[j]) dp[i] = dp[j] + 1, cnt[i] = cnt[j];
else if (dp[i] == dp[j] + 1) cnt[i] += cnt[j], cnt[i] %= mod;
}
}
}
for (int i = 0; i < n; ++i) {
if (ans < dp[i]) ans = dp[i], cn = cnt[i];
else if (ans == dp[i]) cn += cnt[i], cn %= mod;
}
}
cout << ans << ' ' << cn;
return 0;
}
