test

//
// Created by 胡俊贤 on 2018/6/8.
//

#include <iostream>
#include <cmath>
#include<set>
#include<string.h>
#include <string>
#include <queue>
#include <tuple>
#include <algorithm>
#include <stack>
#define inf 0x3f3f3f3f
#define LL long long
#define mod 100000007
using namespace std;

struct good{
    double w,m,a;
     friend bool operator < (good a,good b){
         return a.a>b.a;
    }
};
int main(){
    good good1[7];
    for(int i=0;i<7;i++){
        cin>>good1[i].w>>good1[i].m;
        good1[i].a=good1[i].m/good1[i].w;
    }
    sort(good1,good1+7);
    //for(int i=0;i<7;i++)cout<<good1[i].m<<' ';
    int M=150,value=0,i=0;
    while(M){
        if(M>good1[i].w){
            M-=good1[i].w;
            value+=good1[i++].m;
        }else {
            value+=good1[i++].a*M;
            M=0;
        }
    }
    cout<<value;
}