Stores <CompleteSearch>

#include <bits/stdc++.h>
using namespace std;
int n;
long double cnta=0,cntb=0;
int a[20],b[20];
long double sa=0,sb=0;
long double mn=2e9;
void search(int i){
    if(i==n){
        long double disa=(100-cnta)/100;
        long double disb=(100-cntb)/100;
        long double rs=(disa*sa)+(disb*sb);
        if(mn>rs) mn=rs;
        return;
    }
    int j=i+1;
    sa+=a[i];
    cnta++;
    search(j);
    cnta--;
    sa-=a[i];
    sb+=b[i];
    cntb++;
    search(j);
    cntb--;
    sb-=b[i];
}

int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(int i=0;i<n;i++){
        scanf("%d",&b[i]);
    }
    search(0);
    printf("%.2Lf",mn);
}