using System;

using System.Collections;

using System.Collections.Specialized;

using System.Collections.Generic;

using System.IO;

​

namespace codeforces

{

    public class Program

    {

        public static void Main(string[] args)

        {

            //Console.SetIn(new StreamReader("input.txt"));

​

            int res = equalStacks();  

            Console.WriteLine(res);

            //solve_candies();

            //int[] clowns = Array.ConvertAll(arr1, delegate(string s) { return int.Parse(s); });

​

​

        }

​

        public static int equalStacks()

        {

            int result = 0;

            string n = Console.ReadLine();

            int localSum1 = 0; 

            Stack<int> hs1 = new Stack<int>();

            string[] s = Console.ReadLine().Split(' ');

            for (int i = s.Length - 1; i >= 0 ; --i)

            {

                int curNum = Convert.ToInt32(s[i]);

                localSum1 += curNum;

                hs1.Push(curNum);

            }

​

            int localSum2 = 0;        

            Stack<int> hs2 = new Stack<int>();

            s = Console.ReadLine().Split(' ');

            for (int i = s.Length - 1; i >= 0 ; --i)

            {

                int curNum = Convert.ToInt32(s[i]);

                localSum2 += curNum;

                hs2.Push(Convert.ToInt32(s[i]));

            }

​

            int localSum3 = 0;

            Stack<int> hs3 = new Stack<int>();

            s = Console.ReadLine().Split(' ');

            for (int i = s.Length - 1; i >= 0 ; --i)

            {

                int curNum = Convert.ToInt32(s[i]);

                localSum3 += curNum;

                hs3.Push(Convert.ToInt32(s[i]));

            }

            while (true)

            {

                if (localSum1 == localSum2 && localSum1 == localSum3)

                {

                    result = localSum1;

                    break;

                }

                if (localSum1 > localSum2)

                {

                    localSum1 -= hs1.Pop();

                }

​

                if (localSum2 > localSum3)

                {

                    localSum2 -= hs2.Pop();

                }

​

                if (localSum3 > localSum1)

                {

                    localSum3 -= hs3.Pop();

                }

            }

​

            return result;

        }

​

​

        public static int BinarySearchIterative(int[] haystack, int needle)

        {

            int left = 0;

            int right = haystack.Length - 1;

            while (right >= left)

            {

                int middle = left + (right - left) / 2;

                if (haystack[middle] == needle)

                {

                    return middle;

                }

                if (haystack[middle] > needle)

                {

                    right = middle - 1;

                }

                else

                {

                    left = middle + 1;

                }

            }

            return -1;

        }

        public static void static_newyear_chaos(int[] q)

        {

            List<KeyValuePair<int, int>> gens = new List<KeyValuePair<int, int>>();

            for (int i = 0; i < q.Length; i++)

            {

                gens.Add(new KeyValuePair<int, int>(i + 1, q[i]));

            }

​

            gens.Sort((a, b) => a.Value.CompareTo(b.Value));

​

            for (int i = 0; i < q.Length; i++)

            {

                Console.WriteLine("{0}={1}", gens[i].Key, gens[i].Value);

            }

        }

        public static void solve_candies()

        {

            //https://www.hackerrank.com/challenges/candies/problem

​

            int n = Convert.ToInt32(Console.ReadLine());

​

            List<KeyValuePair<int, int>> students = new List<KeyValuePair<int, int>>();

            for (int i = 1; i <= n; i++)

            {

                students.Add(new KeyValuePair<int, int>(i, Convert.ToInt32(Console.ReadLine())));

            }

​

            students.Sort((a, b) => a.Value.CompareTo(b.Value));

​

            for (int i = 0; i < students.Capacity; i++)

            {

                //search by index, if it is in the left we add +1.

                //if the next seach again in the left we add +1 to the existing +1.

                //BinarySearchIterative(students[i], 2);

            }

​

            /*int prev = -1;

            int totalCandies = 0;

            int candies = 0;

            for (int i = 0; i < n; i++)

            {

                int student = Convert.ToInt32(Console.ReadLine());

​

                if (student > prev)

                {

                    candies++;

                }

                else

                {

                    candies = 1;

                }

                prev = student;

                totalCandies += candies;

            }

​

            Console.WriteLine(totalCandies);

            */

        }

    }

}

​