#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    vec dijkstra(int s, int t){
        vec d(N);
        priority_queue<Pii, vector<Pii>, greater<Pii>> que;
        fill(d.begin(), d.end(), INF);
        d[s] = 0;
        que.push(Pii(0, s));

        while(!que.empty()){
            Pii p = que.top(); que.pop();
            int v = p.second;
            if(v == t) return d;
            if(d[v] < p.first) continue;
            REP(i, G[v].size()){
                edge e = G[v][i];
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    que.push(Pii(d[e.to], e.to));
                }
            }
        }
        return d;
    }

};

int num[50][20][50][20];

signed main(){

    int N; cin >> N;
    vector<string> S(N);
    vec C(N);
    REP(i, N){
        cin >> S[i] >> C[i];
    }

    Graph G(1000002);
    int s = 1000000, t = s + 1;

    REP(i, 50) REP(j, 20) REP(k, 50) REP(l, 20){
        num[i][j][k][l] = ((i * 20 + j) * 50 + k) * 20 + l;
    }

    REP(i, N) REP(j, N) if(S[i][0] == S[j].back()){
        G.add_Directed_edge(s, num[i][0][j][SZ(S[j]) - 1], C[i] + C[j]);
    }

    const int offset = 1000000000;
    REP(i, N) REP(j, N){
        REP(n, SZ(S[i])) REP(m, SZ(S[j])){
            if(n == SZ(S[i]) - 1 && m == 0){
                G.add_Directed_edge(num[i][n][j][m], t, offset);
            }else if(n == SZ(S[i]) - 1){
                REP(k, N) if(S[k][0] == S[j][m - 1]){
                    G.add_Directed_edge(num[i][n][j][m], num[k][0][j][m - 1], C[k]);
                }
            }else if(m == 0){
                REP(k, N) if(S[i][n + 1] == S[k].back()){
                    G.add_Directed_edge(num[i][n][j][m], num[i][n + 1][k][SZ(S[k]) - 1], C[k]);
                }
            }else if(S[i][n + 1] == S[j][m - 1]){
                G.add_Directed_edge(num[i][n][j][m], num[i][n + 1][j][m - 1], 0);
            }
        }
    }

    REP(i, N) REP(n, SZ(S[i])){
        G.add_Directed_edge(num[i][n][i][n], t, offset - C[i]);
        if(n < SZ(S[i]) - 1 && S[i][n] == S[i][n + 1]){
            G.add_Directed_edge(num[i][n][i][n + 1], t, offset - C[i]);
        }
    }

    int ans = G.dijkstra(s, t)[t];
    chOut(ans < INF, ans - offset, -1);

    return 0;
}


Measured memory_bytes: 53016