#include <bits/stdc++.h>
using namespace std;
 
int solve(vector<int>& a , int x , int y){
	int n = a.size();
	vector<int>prefix(n,0);
	for(int i=0;i<n;i++){
		if(i<y){
			prefix[i] = a[i];
		}
		else{
			prefix[i] = a[i] + prefix[i-y];
		}
	}
 
	int ans = INT_MAX;
	for(int i=0;i<n;i++){
		int index = i-(x*y);
		if(index>=0){
			int g = prefix[i];
			g -= prefix[index];
			ans = min(ans,g);
		}
	}
 
	return ans;
}
 
int main() {
	int n;
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
 
	int x,y;
	cin>>x>>y;
 
	cout<<solve(a,x,y);
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc29sdmUodmVjdG9yPGludD4mIGEgLCBpbnQgeCAsIGludCB5KXsKCWludCBuID0gYS5zaXplKCk7Cgl2ZWN0b3I8aW50PnByZWZpeChuLDApOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJaWYoaTx5KXsKCQkJcHJlZml4W2ldID0gYVtpXTsKCQl9CgkJZWxzZXsKCQkJcHJlZml4W2ldID0gYVtpXSArIHByZWZpeFtpLXldOwoJCX0KCX0KCQoJaW50IGFucyA9IElOVF9NQVg7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgaW5kZXggPSBpLSh4KnkpOwoJCWlmKGluZGV4Pj0wKXsKCQkJaW50IGcgPSBwcmVmaXhbaV07CgkJCWcgLT0gcHJlZml4W2luZGV4XTsKCQkJYW5zID0gbWluKGFucyxnKTsKCQl9Cgl9CgkKCXJldHVybiBhbnM7Cn0KCmludCBtYWluKCkgewoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PmEobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFbaV07Cgl9CgkKCWludCB4LHk7CgljaW4+Png+Pnk7CgkKCWNvdXQ8PHNvbHZlKGEseCx5KTsKCXJldHVybiAwOwp9

NwoxIDUgOCAxIDQgNSA4CjIgMg==

7
1 5 8 1 4 5 8
2 2