#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "COCI16_zoltan"
void Fi(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp", "r", stdin);
freopen(PROB".out", "w", stdout);
}
}
const int N = 2e5 + 1;
const int MOD = 1e9 + 7;
int a[N], n;
vector<int> X;
using pi = pair<int, int>;
pi bitU[N], bitD[N];
pi comb(const pi &a, const pi &b){
return a.fi == b.fi ? mp(a.fi, (a.se + b.se) % MOD)
: (a.fi > b.fi) ? a : b;
}
void updateU(int i, const pi &v){
while(1 <= i){
bitU[i] = comb(bitU[i], v);
i -= i & -i;
}
}
pi getU(int i){
pi ans = {0, 0};
while(i <= X.size()){
ans = comb(ans, bitU[i]);
i += i & -i;
}
return ans;
}
void updateD(int i, const pi &v){
while(i <= X.size()){
bitD[i] = comb(v, bitD[i]);
i += i & -i;
}
}
pi getD(int i){
pi ans = {0, 0};
while(1 <= i){
ans = comb(bitD[i], ans);
i -= i & -i;
}
return ans;
}
int mul(const int &a, const int &b){
return (1LL * a * b) % MOD;
}
int powmod(int a, int b){
int ans = 1;
for(; b > 0; b >>= 1){
if(b & 1) ans = mul(ans, a);
a = mul(a, a);
}
return ans;
}
int main(){
IOS;
Fi();
cin >> n;
FORU(i, 1, n){
cin >> a[i];
X.eb(a[i]);
}
sort(ALL(X));
X.resize(unique(ALL(X)) - X.begin());
pi ans = {0, 0};
FORD(i, n, 1){
a[i] = lower_bound(ALL(X), a[i]) - X.begin() + 1;
pi l = getD(a[i] - 1); l.fi += 1;
l = max(l, {1, 1});
updateD(a[i], l);
pi r = getU(a[i] + 1); r.fi += 1;
r = max(r, {1, 1});
updateU(a[i], r);
pi tmp = {l.fi + r.fi - 1, mul(l.se, r.se)};
ans = comb(ans, tmp);
}
ans.se = mul(ans.se, powmod(2, n - ans.fi));
cout << ans.fi << " " << ans.se;
return 0;
}
