#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <functional>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
using ll = unsigned long long;
const ll mod = 1000000007;
string al = "abcdefghijklmnopqrstuvwxyz";
//bool less_sec(const pair<int, int>&a, const pair<int, int>&b) {
//	return a.second > b.second;
//}
int Aw, Ab, Bw, Bb, C, D;
int arn[101], arm[101];
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
    cin >> Aw >> Ab >> Bw >> Bb >> C >> D;
    if(Ab>=C){
        Bb +=C;
        if(Bw>=D){
            cout << Aw+D << endl;
        }else{
            cout << Aw+Bw << endl;
        }
    }else{
        Bb += Ab;
        Aw -= C-Ab;
        Bw += C-Ab;
        if(Bw>=D){
            cout << Aw+D << endl;
        }else{
            cout << Aw+Bw << endl;
        }
    }
	return 0;
}