using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
using Number = System.Int64;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n = sc.Int;
        var s = new string[n];
        var c = new long[n];
        for (int i = 0; i < n; i++)
        {
            sc.Multi(out s[i], out c[i]);
        }
        int m = n * 21 * 2 + 2;
        var edge = new List<pair<long, int>>[m];
        for (int i = 0; i < m; i++)
        {
            edge[i] = new List<pair<long, int>>();
        }
        int S = m - 2;
        int T = m - 1;
        for (int i = 0; i < n; i++)
        {
            {
                int nd = (i * 21 + 0) * 2 + 0;
                edge[S].Add(new pair<long, int>(c[i], nd));
            }
            for (int j = 0; j < s[i].Length; j++)
            {
                var t = s[i].Substring(j);
                int nd = (i * 21 + j) * 2 + 0;
                if (ispal(t)) {
                    edge[nd].Add(new pair<long, int>(0, T));
                }
                for (int k = 0; k < n; k++)
                {
                    if (s[k].Length == t.Length) {
                        if (ispal(t, s[k])) {
                            edge[nd].Add(new pair<long, int>(c[k], T));
                        }
                    }
                    else if (s[k].Length < t.Length) {
                        if (ispal(t.Substring(0, s[k].Length), s[k])) {
                            int nd2 = (i * 21 + j + s[k].Length) * 2 + 0;
                            edge[nd].Add(new pair<long, int>(c[k], nd2));
                        }
                    }
                    else {
                        if (ispal(t, s[k].Substring(s[k].Length - t.Length))) {
                            int nd2 = (k * 21 + s[k].Length - t.Length) * 2 + 1;
                            edge[nd].Add(new pair<long, int>(c[k], nd2));
                        }
                    }
                }
            }
            for (int j = 1; j <= s[i].Length; j++)
            {
                var t = s[i].Substring(0, j);
                int nd = (i * 21 + j) * 2 + 1;
                if (ispal(t)) {
                    edge[nd].Add(new pair<long, int>(0, T));
                }
                for (int k = 0; k < n; k++)
                {
                    if (s[k].Length == t.Length) {
                        if (ispal(t, s[k])) {
                            edge[nd].Add(new pair<long, int>(c[k], T));
                        }
                    }
                    else if (s[k].Length < t.Length) {
                        if (ispal(t.Substring(t.Length - s[k].Length), s[k])) {
                            int nd2 = (i * 21 + j - s[k].Length) * 2 + 1;
                            edge[nd].Add(new pair<long, int>(c[k], nd2));
                        }
                    }
                    else {
                        if (ispal(t, s[k].Substring(0, t.Length))) {
                            int nd2 = (k * 21 + t.Length) * 2 + 0;
                            edge[nd].Add(new pair<long, int>(c[k], nd2));
                        }
                    }
                }
            }
        }
        long ans = ShortestPath.Dijkstra(edge, S, LM)[T];
        Prt(ans == LM ? -1 : ans);
    }
    bool ispal(string s) {
        for (int i = 0; i < s.Length - 1 - i; i++)
        {
            if (s[i] != s[s.Length - 1 - i]) return false;
        }
        return true;
    }
    bool ispal(string s, string t) {
        if (s.Length != t.Length) return false;
        for (int i = 0; i < s.Length; i++)
        {
            if (s[i] != t[t.Length - 1 - i]) return false;
        }
        return true;
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}


static class ShortestPath {
    public static void WarshallFloyd(Number[][] g) {
        int n = g.Length;
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                for (int k = 0; k < n; ++k)
                    g[j][k] = Math.Min(g[j][k], g[j][i] + g[i][k]);
    }

    class Heap {
        int n;
        Number[] values;
        int[] keys, indices;

        void Update(int i, Number val) {
            if (indices[i] == -1) {
                keys[n] = i;
                indices[i] = n;
                ++n;
            }
            values[i] = val;
            int p = indices[i];
            while (p > 0) {
                int par = p - 1 >> 1;
                if (values[keys[par]] > val) {
                    keys[p] = keys[par];
                    indices[keys[p]] = p;
                    p = par;
                }
                else break;
            }
            keys[p] = i;
            indices[i] = p;
        }
        int Pop() {
            --n;
            int ret = keys[0];
            indices[ret] = -1;
            int i = keys[n];
            keys[n] = -1;
            Number val = values[i];
            if (n == 0) return ret;
            int p = 0;
            while ((p << 1 | 1) < n) {
                int ch = p << 1 | 1;
                if (ch < n - 1 && values[keys[ch]] > values[keys[ch + 1]]) ++ch;
                if (val > values[keys[ch]]) {
                    keys[p] = keys[ch];
                    indices[keys[p]] = p;
                    p = ch;
                }
                else break;
            }
            keys[p] = i;
            indices[i] = p;
            return ret;
        }

        void init(int m, int s, Number inf) {
            values = new Number[m];
            keys = new int[m];
            indices = new int[m];
            for (int i = 0; i < m; i++) {
                values[i] = inf;
                keys[i] = -1;
                indices[i] = -1;
            }
            values[s] = 0;
            keys[0] = s;
            indices[s] = 0;
        }

        public Number[] Run(List<pair<Number, int>>[] edges, int s, Number inf) {
            init(edges.Length, s, inf);

            n = 1;
            while (n > 0) {
                int p = Pop();
                foreach (var e in edges[p])
                    if (values[e.v2] > values[p] + e.v1)
                        Update(e.v2, values[p] + e.v1);
            }
            return values;
        }
        public pair<Number[], long[]> Run(List<pair<Number, int>>[] edges, int s, long Mod, Number inf) {
            init(edges.Length, s, inf);
            var cnts = new long[edges.Length];
            cnts[s] = 1;

            n = 1;
            while (n > 0) {
                int p = Pop();
                foreach (var e in edges[p])
                    if (values[e.v2] > values[p] + e.v1) {
                        cnts[e.v2] = cnts[p];
                        Update(e.v2, values[p] + e.v1);
                    }
                    else if (values[e.v2] == values[p] + e.v1)
                        cnts[e.v2] = (cnts[e.v2] + cnts[p]) % Mod;
            }
            return new pair<Number[], long[]>(values, cnts);
        }
    }

    public static Number[] Dijkstra(List<pair<Number, int>>[] edges, int s, Number inf)
        => new Heap().Run(edges, s, inf);

    public static pair<Number[], long[]> Dijkstra(List<pair<Number, int>>[] edges, int s, long Mod, Number inf)
        => new Heap().Run(edges, s, Mod, inf);
}


Measured memory_bytes: 22564