#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
namespace Random
{
#define int long long
int Rand(int l , int r)
{
return uniform_int_distribution<int>(l , r)(rng);
}
#undef int
}
using i64 = long long;
using ui64 = unsigned long long;
#define MASK(x) ((i64)(1) << (x))
#define BIT(mask , x) (((mask) >> (x)) & (1))
#define sz(x) (x).size()
#define all(x) (x).begin() , (x).end()
#define FOR(i ,a , b) for (int i = (a); i <= (b); ++i)
#define FORD(i , a , b) for (int i = (b); i >= (a); --i)
#define REP(i , a , b) for (int i = (a); i < (b); ++i)
#define REPD(i , a , b) for (int i = (b) - 1 ; i >= (a); --i)
template <class T>
void compress(vector<T> &a)
{
sort(a.begin() , a.end());
a.resize(unique(a.begin() , a.end()) - a.begin());
return;
}
template<class T>
void printArr(T& container , string separator = "" , string finish = "\n")
{
for (auto& item : container) cout << item << separator;
cout << finish;
}
template<class T>
bool maximize(T &a , T b) {if (a < b) return a = b , true; else return false;}
template<class T>
bool minimize(T &a , T b) {if (a > b) return a = b , true; else return false;}
template<class T>
T gcd(T x , T y) {while (y) swap(y , x %= y); return x;}
template<class T>
T lcm(T x , T y) {return (x * y) / gcd(x , y);}
//... INPUT
void INPUT(string name)
{
iostream::sync_with_stdio(false); cin.tie(0);
if (!fopen((name + ".inp").c_str() , "r")) return;
freopen((name + ".inp").c_str() , "r" , stdin);
freopen((name + ".out").c_str() , "w+" , stdout);
}
const int maxn = 2e5;
//... MOD OPERATOR
const int MOD = 1e9 + 7;
int add(int a , int b)
{
return (a + b >= MOD ? a + b - MOD : a + b);
}
int mul(int a , int b)
{
return (i64)a * b % MOD;
}
int binpow(int a , int b)
{
int res = 1;
for (; b; b >>= 1 , a = mul(a,a))
if (b&1) res = mul(res , a);
return res;
}
//... FEN
class segment
{
public:
vector<pair<int,int>> st;
void init(int n)
{
st.assign(n*4+2,{0,0});
return;
}
pair<int,int> pushup(pair<int,int>a , pair<int,int> b)
{
if (a.first > b.first) return a;
if (b.first > a.first) return b;
return {a.first , add(a.second , b.second)};
}
void update(int node , int l , int r , int pos , pair<int,int> val)
{
if (l > pos || r < pos) return;
if (l == r)
{
if (st[node].first < val.first) st[node] = val;
else if (st[node].first == val.first) st[node].second = add(st[node].second , val.second);
}
else
{
int m = l + r >> 1;
update(node*2,l,m,pos,val);
update(node*2+1,m+1,r,pos,val);
st[node] = pushup(st[node*2] , st[node*2+1]);
}
return;
}
pair<int,int> get(int node , int l , int r , int u , int v)
{
if (l > v || r < u) return {0,0};
if (u <= l && r <= v) return st[node];
int m = l + r >> 1;
pair<int,int> g1 = get(node*2,l,m,u,v);
pair<int,int> g2 = get(node*2+1,m+1,r,u,v);
return pushup(g1,g2);
}
};
segment st1 , st2;
int n , a[maxn + 2];
int32_t main()
{
INPUT("main");
cin >> n;
vector<int> value;
FOR(i,1,n)
{
cin >> a[i];
value.push_back(a[i]);
}
compress(value);
int length = n;
st1.init(length); st2.init(length);
FOR(i,1,n)
a[i] = upper_bound(all(value),a[i]) - value.begin();
int mxlength = 0 , cnt = 0;
FORD(i,1,n)
{
pair<int,int> c1 = st1.get(1,1,length,1,a[i]-1);
pair<int,int> c2 = st2.get(1,1,length,a[i] + 1,length);
maximize(c1.second , 1);
maximize(c2.second , 1);
if (maximize(mxlength , c1.first + c2.first + 1)) cnt = mul(c1.second , c2.second);
else if (mxlength == c1.first + c2.first + 1) cnt = add(cnt , mul(c1.second , c2.second));
c1.first++; c2.first++;
st1.update(1,1,length,a[i],c1);
st2.update(1,1,length,a[i],c2);
}
cout << mxlength << ' ' << mul(cnt , binpow(2 , n - mxlength));
cerr << "\nTIME RUN : " << 1000 * clock()/CLOCKS_PER_SEC << " MS \n";
}
/** lockheed martin build me - Red Bull boost me **/
