using System;
using System.Collections.Generic;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("29");
            WillReturn.Add("20");
            WillReturn.Add("7");
            WillReturn.Add("35");
            WillReturn.Add("120");
            //215
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("101");
            WillReturn.Add("86");
            WillReturn.Add("119");
            WillReturn.Add("108");
            WillReturn.Add("57");
            //481
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("123");
            WillReturn.Add("123");
            WillReturn.Add("123");
            WillReturn.Add("123");
            WillReturn.Add("123");
            //643
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();

        var ValList = new List<int>();
        for (int I = 0; I <= InputList.Count - 1; I++) {
            ValList.Add(int.Parse(InputList[I]));
        }

        int AnswerSum = int.MaxValue;
        foreach (int[] EachIntArr in RubyPatternCnt.Permutation(ValList.ToArray(), ValList.Count)) {
            int CurrSum = 0;
            foreach(int EachInt in EachIntArr){
                if (CurrSum % 10 == 1) CurrSum += 9;
                if (CurrSum % 10 == 2) CurrSum += 8;
                if (CurrSum % 10 == 3) CurrSum += 7;
                if (CurrSum % 10 == 4) CurrSum += 6;
                if (CurrSum % 10 == 5) CurrSum += 5;
                if (CurrSum % 10 == 6) CurrSum += 4;
                if (CurrSum % 10 == 7) CurrSum += 3;
                if (CurrSum % 10 == 8) CurrSum += 2;
                if (CurrSum % 10 == 9) CurrSum += 1;

                CurrSum += EachInt;
            }
            AnswerSum = Math.Min(AnswerSum, CurrSum);
        }
        Console.WriteLine(AnswerSum);

    }

    //Rubyの場合の数
    internal static class RubyPatternCnt
    {
        //順列を返す
        private struct JyoutaiDef_Permutation
        {
            internal List<int> SelectedIndList;
        }
        internal static IEnumerable<int[]> Permutation(int[] pArr, int pR)
        {
            if (pR == 0) yield break;
            if (pArr.Length < pR) yield break;

            var stk = new Stack<JyoutaiDef_Permutation>();
            JyoutaiDef_Permutation WillPush;
            for (int I = pArr.GetUpperBound(0); 0 <= I; I--) {
                WillPush.SelectedIndList = new List<int>() { I };
                stk.Push(WillPush);
            }

            while (stk.Count > 0) {
                JyoutaiDef_Permutation Popped = stk.Pop();

                //クリア判定
                if (Popped.SelectedIndList.Count == pR) {
                    var WillReturn = new List<int>();
                    Popped.SelectedIndList.ForEach(X => WillReturn.Add(pArr[X]));
                    yield return WillReturn.ToArray();
                    continue;
                }

                for (int I = pArr.GetUpperBound(0); 0 <= I; I--) {
                    if (Popped.SelectedIndList.Contains(I)) continue;
                    WillPush.SelectedIndList = new List<int>(Popped.SelectedIndList) { I };
                    stk.Push(WillPush);
                }
            }
        }
    }
}


Measured memory_bytes: 13396