using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Math;
 
public class Solve{
    static public int mod = 1000000007;
    public static void Main(){
        // 方針
        //
        var n = rint();
        var count = new long[10];
        long ans = 0;
        var change = new int[10,2];
        for(int i=0;i<10;i++){
            change[i,0] = i+i;
            change[i,1] = 1;
            if(i>4) change[i,1]++;
        }
        change[5,0] = 1;
        change[6,0] = 3;
        change[7,0] = 5;
        change[8,0] = 7;
        change[9,0] = 9;
        for(int i=0;i<n;i++){
            var a = longa();
            int t = (int)a[0];
            count[t] += a[1];
            for(int j=0;j<10;j++){
                if(count[j] > 1){
                    long m = count[j]/2;
                    count[j] -= m*2;
                    count[change[j,0]]+=m;
                    ans += change[j,1] * m;
                }
            }
        }
        /*
        WriteLine(ans);
        for(int i=0;i<10;i++){
            Write($"{count[i]} ");
        }
        WriteLine();
        */
        long maxcount = 100;
        while(maxcount>10){
            for(int j=0;j<10;j++){
                if(count[j] > 1){
                    long m = count[j]/2;
                    count[j] -= m*2;
                    count[change[j,0]]+=m;
                    ans += change[j,1] * m;
                }
            }
            long tempcount= 0;
            for(int i=0;i<10;i++){
                tempcount = Max(tempcount,count[i]);
            }
            maxcount = Min(tempcount,maxcount);
            //WriteLine(maxcount);
        }
        /*
        WriteLine(ans);
        for(int i=0;i<10;i++){
            Write($"{count[i]} ");
        }
        WriteLine();
        */
        long temp = 0;
        for(int i=0;i<10;i++){
            while(count[i] > 0){
                temp += i;
                count[i]--;
                ans++;
                if(temp > 9){
                    temp = temp/10 + temp%10;
                    ans++;
                }
            }
        }
        WriteLine(--ans);
        
        
        
        
        
        
        
        
        
        
        
    }
    // 1からaまでの数字並べ替え全通り返すやつ
    static List<string> permutation(int a){var list = new List<string>();if(a == 1){list.Add("1");return list;}else{foreach(var k in permutation(a-1)){var ch = k.ToCharArray();for(int i=0;i<=ch.Length;i++){string intemp = "";if(i == 0){intemp += a.ToString();}for(int j=0;j<ch.Length;j++){intemp += ch[j].ToString();if(i == j+1){intemp += a.ToString();}}list.Add(intemp);}}}return list;}
    public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;}
    static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;}
    static int ncr(int n,int r){r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();}
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long divideup(long divided,long divid){ long temp_divide = divided/divid; if(divided % divid > 0){ temp_divide++; } return temp_divide; }
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
}

Measured memory_bytes: 15252