package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

const MaxInt = math.MaxInt64

var scanner *bufio.Scanner

func main() {
	var n int
	a := make([]int, 3)
	readCount, _ := fmt.Scanf("%d\n%d %d %d", &n, &a[0], &a[1], &a[2])
	if readCount == 4 {
		fmt.Println("assert")
		return
	}
	for i := 1; i < 3; i++ {
		fmt.Scanln(&a[i])
	}
	sum := make([]int, 0)
	for i := 0; i < 2; i++ {
		for j := i + 1; j < 3; j++ {
			sum = append(sum, a[i]+a[j])
		}
	}
	sort.Ints(sum)
	max := sum[len(sum)-1]
	for i := len(sum) - 2; i >= 0; i-- {
		if sum[i] != max {
			fmt.Println(sum[i])
			return
		}
	}
}

func init() {
	scanner = bufio.NewScanner(os.Stdin)
	scanner.Buffer([]byte{}, MaxInt)
	scanner.Split(bufio.ScanWords)
}

func Int() int {
	scanner.Scan()
	ret, _ := strconv.ParseInt(scanner.Text(), 10, 0)
	return int(ret)
}

func Ints(n int) []int {
	ret := make([]int, n)
	for i := 0; i < n; i++ {
		ret[i] = Int()
	}
	return ret
}

func Max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func Min(a, b int) int {
	if a < b {
		return a
	}
	return b
}