#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sgn(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

template<typename M>
std::vector<typename M::T> dijkstra(const std::vector<std::vector<int>> &adj,
                                    const std::vector<std::vector<typename M::E>> &cost,
                                    int s) {
    using T = typename M::T;
    int n = adj.size();
    assert(0 <= s && s < n);
    std::vector<T> ret(n, M::ab());
    using P = std::pair<T, int>;
    auto c = [&](P a, P b) -> bool { return M::gr(a.first, b.first); };
    std::priority_queue<P, std::vector<P>, decltype(c)> pq(c);
    ret[s] = M::id();
    pq.push({ret[s], s});
    while (!pq.empty()) {
        P p = pq.top();
        pq.pop();
        int v = p.second;
        if (M::gr(p.first, ret[v])) { continue; }
        for (int i = 0; i < adj[v].size(); i++) {
            int u = adj[v][i];
            T dist = M::op(ret[v], cost[v][i]);
            if (M::gr(ret[u], dist)) { ret[u] = dist, pq.push({ret[u], u}); }
        }
    }
    return ret;
}

struct int_dij {
    using T = int;
    using E = int;
    static T id() { return 0; }
    static T ab() { return std::numeric_limits<T>::max(); }
    static T op(const T &a, const E &b) { return a == ab() ? ab() : a + b; }
    static bool gr(const T &a, const T &b) { return a > b; }
};

int N;
string S[55], T[55];
int C[55];
signed main() {
    cin >> N;
    rep(i, N) { cin >> S[i] >> C[i], T[i] = S[i], reverse(all(T[i])); }
    vvint adj(11000), cost(11000);
    rep(i, N) { adj[0].emplace_back(i + 1), cost[0].emplace_back(C[i]); }
    rep(i, N) {
        rep(j, N) {
            rep(k, S[i].length()) {
                if (S[i].length() < k + T[j].length()) {
                    if (S[i].substr(k) == T[j].substr(0, S[i].length() - k)) {
                        adj[100 * k + i + 1].emplace_back(100 * (S[i].length() - k) + j + 5000);
                        cost[100 * k + i + 1].emplace_back(C[j]);
                    }
                }
                if (S[i].length() > k + T[j].length()) {
                    if (S[i].substr(k, T[j].length()) == T[j]) {
                        adj[100 * k + i + 1].emplace_back(100 * (T[j].length() + k) + i + 1);
                        cost[100 * k + i + 1].emplace_back(C[j]);
                    }
                }
                if (S[i].length() == k + T[j].length()) {
                    if (S[i].substr(k) == T[j]) {
                        adj[100 * k + i + 1].emplace_back(10000);
                        cost[100 * k + i + 1].emplace_back(C[j]);
                    }
                }
            }
        }
    }
    rep(i, N) {
        rep(j, N) {
            rep(k, T[i].length()) {
                if (T[i].length() < k + S[j].length()) {
                    if (T[i].substr(k) == S[j].substr(0, T[i].length() - k)) {
                        adj[100 * k + i + 5000].emplace_back(100 * (T[i].length() - k) + j + 1);
                        cost[100 * k + i + 5000].emplace_back(C[j]);
                    }
                }
                if (T[i].length() > k + S[j].length()) {
                    if (T[i].substr(k, S[j].length()) == S[j]) {
                        adj[100 * k + i + 5000].emplace_back(100 * (S[j].length() + k) + i + 5000);
                        cost[100 * k + i + 5000].emplace_back(C[j]);
                    }
                }
                if (T[i].length() == k + S[j].length()) {
                    if (T[i].substr(k) == S[j]) {
                        adj[100 * k + i + 5000].emplace_back(10000);
                        cost[100 * k + i + 5000].emplace_back(C[j]);
                    }
                }
            }
        }
    }
    rep(i, N) {
        rep(j, S[i].length()) {
            string s = S[i].substr(j);
            string r = s;
            reverse(all(r));
            if (s == r) {
                adj[100 * j + i + 1].emplace_back(10000);
                cost[100 * j + i + 1].emplace_back(0);
            }
        }
        rep(j, T[i].length()) {
            string t = T[i].substr(j);
            string r = t;
            reverse(all(r));
            if (t == r) {
                adj[100 * j + i + 5000].emplace_back(10000);
                cost[100 * j + i + 5000].emplace_back(0);
            }
        }
    }
    int ans = dijkstra<int_dij>(adj, cost, 0)[10000];
    if (ans == LLONG_MAX) { cout << -1 << endl; }
    else { cout << ans << endl; }

}

Measured memory_bytes: 4024