#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int solution(int A[],int N,int X,int Y)
{
int min_cost=1e+9;
int count,cost;
for(int i=0;i<N;i++)
{
count=1;
cost=A[i];
int j=i;
if(j+Y>N)
{
break;
}
else {
while(count<X)
{
cost=cost+A[j+Y];
j=j+Y;
count++;
}
min_cost=min(cost,min_cost);
}
}
//cout<<min_cost;
return min_cost;
}
int main() {
// your code goes here
int n;
cin>>n;
int arr[n];
int i=0;
while(i<n)
{
cin>>arr[i];
i++;
}
int x,y;
cin>>x;
cin>>y;
cout<<solution(arr,n,x,y);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBzb2x1dGlvbihpbnQgQVtdLGludCBOLGludCBYLGludCBZKQp7CiAJaW50IG1pbl9jb3N0PTFlKzk7CiAJaW50IGNvdW50LGNvc3Q7CiAJZm9yKGludCBpPTA7aTxOO2krKykKIAkgewogCSAJY291bnQ9MTsKIAkgCWNvc3Q9QVtpXTsKIAkgCWludCBqPWk7CiAJIAlpZihqK1k+TikKIAkgCSB7CiAJIAkgICAgYnJlYWs7CiAJIAkgfQogCSAJIGVsc2UgewogCSAJIAl3aGlsZShjb3VudDxYKQogCSAJIAkgewogCSAJIAkgCWNvc3Q9Y29zdCtBW2orWV07CiAJIAkgCSAJaj1qK1k7CiAJIAkgCSAJY291bnQrKzsKIAkgCSAJIH0KIAkgCSAJIG1pbl9jb3N0PW1pbihjb3N0LG1pbl9jb3N0KTsKIAkgCSB9CiAJIAkgCQogCSB9CiAJIC8vY291dDw8bWluX2Nvc3Q7CiAJIHJldHVybiBtaW5fY29zdDsKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCWludCBhcnJbbl07CglpbnQgaT0wOwoJd2hpbGUoaTxuKQoJIHsKCSAJY2luPj5hcnJbaV07CgkgCWkrKzsKCSB9CgkgaW50IHgseTsKCSBjaW4+Png7CgkgY2luPj55OwoJIGNvdXQ8PHNvbHV0aW9uKGFycixuLHgseSk7CglyZXR1cm4gMDsKfQ==