# include<bits/stdc++.h>
# define int long long
using namespace std;
const int N=2e3+10;
int s1[N],s2[N];int n;
inline int read()
{int X=0,w=0; char c=0;while(c<'0'||c>'9') {w|=c=='-';c=getchar();}while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return w?-X:X;
}
inline void write(int x)
{if (x<0) x=-x,putchar('-'); if (x>9) write(x/10);putchar(x%10+'0');
}
signed main()
{n=read();for (int i=1;i<=n;i++) {int t=read(); s1[i]=s1[i-1]+t;s2[i]=s2[i-1]+t*t;}double ans=-1e9; int ansl=0,ansr=0;for (int l=1;l<=n;l++)for (int r=l;r<=n;r++) {double t=-(double)(s1[r]-s1[l-1])*(s1[r]-s1[l-1])/(double)(r-l+1)/(double)(r-l+1);double w=(double)(s2[r]-s2[l-1])/(double)(r-l+1); if (t+w>ans) { ans=t+w; ansl=l; ansr=r;}}write(ansl);putchar(' ');write(ansr); putchar('\n');return 0;
}

# include <bits/stdc++.h>
# define int long long
using namespace std;
const int N=3e5+10;
int from[N],f[N],s[N],n;
inline int read()
{int X=0,w=0; char c=0;while(c<'0'||c>'9') {w|=c=='-';c=getchar();}while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return w?-X:X;
}
inline void write(int x)
{if (x<0) x=-x,putchar('-'); if (x>9) write(x/10);putchar(x%10+'0');
}
signed main()
{n=read();for (int i=1;i<=n;i++) {int t=read();if (t>i) continue;from[i]=t;}for (int i=1;i<=n;i++) {int t=read();s[i]=s[i-1]+t;}for (int i=1;i<=n;i++) {f[i]=f[i-1]+s[i]-s[i-1];if (from[i]!=0) f[i]=max(f[from[i]-1]+2*(s[i]-s[from[i]-1]),f[i]);}write(f[n]);putchar('\n'); return 0;
}

# include<bits/stdc++.h>
# define int long long
using namespace std;
const int mo=1e9+7;
const int base=131;
const int N=1e3+10;
int p[N],a[N],hash1[N],hash2[N],f[N];
int n;
vector<int>v[N];
inline int read()
{int X=0,w=0; char c=0;while(c<'0'||c>'9') {w|=c=='-';c=getchar();}while(c>='0'&&c<='9') X=(X<<3)+(X<<1)+(c^48),c=getchar();return w?-X:X;
}
inline void write(int x)
{if (x<0) x=-x,putchar('-'); if (x>9) write(x/10);putchar(x%10+'0');
}
int gethash(int num,int l,int r)
{if (num==1) return ((hash1[r]-hash1[l-1]*p[r-l+1]%mo)%mo+mo)%mo;else return ((hash2[r]-hash2[l-1]*p[r-l+1]%mo)%mo+mo)%mo;
}
bool check(int l,int r)
{if ((r-l+1)&1) {int pos=(l+r)/2,len=(r-l)/2;        if (gethash(1,pos,pos+len)==gethash(2,n+1-pos,n+1-pos+len)) return 1;else return 0;} else {int pos1=(l+r)/2,pos2=pos1+1,len=(r-l-1)/2;if (gethash(1,pos2,pos2+len)==gethash(2,n+1-pos1,n+1-pos1+len)) return 1;else return 0;}
}
void fun(int pos)
{for (int mid=(n+1-pos)/2;mid>=1;mid--) if (check(pos,pos+mid-1)&&check(pos+mid,pos+2*mid-1)&&gethash(1,pos,pos+mid-1)==gethash(1,pos+mid,pos+2*mid-1)) v[pos].push_back(pos+2*mid-1);
}
signed main()
{
//    freopen("dance.in","r",stdin);
//    freopen("dance.out","w",stdout);n=read(); p[0]=1;for (int i=1;i<=n;i++) a[i]=read(),p[i]=p[i-1]*base%mo;    for (int i=1;i<=n;i++) hash1[i]=(hash1[i-1]*base%mo+a[i])%mo;int u=0;    for (int i=n;i>=1;i--) u++,hash2[u]=(hash2[u-1]*base%mo+a[i])%mo;for (int i=1;i<=n;i++) fun(i); for (int i=n;i>=1;i--) {f[i]=f[i+1];for (int j=0;j<v[i].size();j++)f[i]=max(f[i],f[v[i][j]+1]+(v[i][j]-i+1));}write(f[1]); putchar('\n');return 0;
}