#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
#include <string>
#include <list>
#include <iterator>
#include <sstream>
#include <complex>
#include <fstream>
#include <functional>
#include <numeric>
#include <utility>
#include <algorithm>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <random>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds;
using namespace std;

template<class T> using OrderedSet = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// MACROS_BEGIN
#define CLEAR() cerr << endl;
#define LET(x, a) __typeof(a) x = a
#define FOREACH(it, v) for (LET(it, (v).begin()); it != (v).end(); ++it)
#define REPEAT(i, n) for (int i = 0; i < (n); ++i)
// MACROS_END

// GENERIC_UTILITIES_BEGIN
// template <class T> inline int size(const T& c) {return (int) c.size();}
inline long long two(int x) {return (1LL << (x));}

vector<string> split(string s, string delim) {
    s += delim[0];
    string tmp;
    vector<string> result;
    for (int i = 0; i < size(s); ++i) {
        if (delim.find(s[i]) == string::npos) {
            tmp.push_back(s[i]);
        }
        else {
            if (tmp != "") result.push_back(tmp);
            tmp.clear();
        }
    }
    return result;
}
// GENERIC_UTILITIES_END

// FAST_IO_BEGIN
// FAST_IO_END

// STANDARD_IO_BEGIN
#ifndef USING_FAST_IO
int readInt() {int N = -1; scanf("%d", &N); return N;}
double readDouble() {double D; scanf("%lf", &D); return D;}
string readString() {char buffer[1 << 20]; scanf("%s", buffer); return buffer;}
long long readLongLong() {long long N = -1; scanf("%lld", &N); return N;}
#endif // NOT DEFINED USING_FAST_IO
// STANDARD_IO_END


// OUTPUT_UTILITIES_BEGIN
template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p);
template <class T> ostream& operator << (ostream& o, const vector<T>& v);
template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m);
template <class T> ostream& operator << (ostream& o, const set<T>& s);
template <class T> ostream& operator << (ostream& o, const queue<T>& q);
template <class T> ostream& operator << (ostream& o, const stack<T>& s);

template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p) {
    o << "(" << p.first << "," << p.second << ")"; return o;
}

template <class T> ostream& operator << (ostream& o, const vector<T>& v) {
    o << "{"; bool first = true; FOREACH(it, v) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m) {
    o << "{"; bool first = true; FOREACH(it, m) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const set<T>& s) {
    o << "{"; bool first = true; FOREACH(it, s) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const queue<T>& q) {
    o << "{"; bool first = true; queue<T> p = q; while (!p.empty()) { if (!first) o << ","; first = false; o << p.front(); p.pop(); } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const stack<T>& s) {
    o << "{"; bool first = true; stack<T> r = s; while (!r.empty()) { if (!first) o << ","; first = false; o << r.top(); r.pop(); } return o << "}";
}
// OUTPUT_UTILITIES_END

// DEBUGGING_UTILITIES_BEGIN
// DEBUGGING SWITCH
#define PHOENIX_DEBUG

#ifdef PHOENIX_DEBUG
#define DEBUG(...) __f(__LINE__, #__VA_ARGS__, __VA_ARGS__)

template<typename Arg> void __print(const string& name, Arg&& arg) {
    cerr << "[" << name << ": " << arg << "]" << " ";
}

void __printLine(int line) {
    cerr << "LINE " << line << ": ";
    cerr << boolalpha;    
}

template<typename Arg> void __g(vector<string>& names, int idx, Arg&& arg) {
    __print(names[idx], arg);
}

template<typename Arg, typename... Args> void __g(vector<string>& names, int idx, Arg&& arg, Args&&... args) {
    __g(names, idx, arg); __g(names, idx + 1, args...);
}

template <typename Arg> void __f(int line, const string& name, Arg&& arg) {
    __printLine(line);
    __print(name, arg); CLEAR();
}

template <typename Arg, typename... Args> void __f(int line, const string& _names, Arg&& arg, Args&&... args) {
    __printLine(line);
    vector<string> names = split(_names, ", "); __g(names, 0, arg, args...); CLEAR();
}
#else
#define DEBUG(...)
#endif
// DEBUGGING_UTILITIES_END

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const double epsilon = 1e-8;
const int infinite    = 2000000000; // 2 * 10^9
const long long infiniteLL = 2000000000000000000LL; // 2 * 10^18
const long long modulo = 1000000007;

typedef pair<long long, pair<string, string>> State;

struct Graph {
    int N;
    vector<string> S;
    vector<long long> C;
    map<pair<string, string>, long long> dist;
    map<pair<string, string>, bool> visited;
    bool mergeStatus;
    long long bestSingle;
    long long answer;

    void initialize(int _N, vector<string>& _S, vector<long long>& _C) {
        N = _N, S = _S, C = _C;
    }

    bool isPalindrome(const string& s) {
        for (int i = 0; i < size(s) - i - 1; ++i) {
            if (s[i] != s[size(s) - i - 1]) {
                return false;
            }
        }

        return true;
    }

    void singlePalindrome() {
        bestSingle = infiniteLL;

        for (int i = 0; i < N; ++i) {
            if (isPalindrome(S[i])) {
                bestSingle = min(bestSingle, C[i]);
            }
        }
    }

    pair<string, string> merge(string s, string t) {
        int i = 0, j = size(t) - 1;
        mergeStatus = true;

        while (i < size(s) && j >= 0 && s[i] == t[j]) {
            ++i;
            --j;
        }

        if (i == size(s)) {
            return {"", t.substr(0, j + 1)};
        }

        if (j == -1) {
            return {s.substr(i), ""};
        }

        mergeStatus = false;
        return {"", ""};
    }

    long long solve() {
        singlePalindrome();
        priority_queue<State, vector<State>, greater<State>> pq;

        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                pair<string, string> merged = merge(S[i], S[j]);

                if (mergeStatus) {
                    if (!visited[merged]) {
                        dist[merged] = infiniteLL;
                    }

                    dist[merged] = min(dist[merged], C[i] + C[j]);
                    visited[merged] = true;
                    pq.push({C[i] + C[j], merged});
                }
            }
        }

        while (!pq.empty()) {
            State state = pq.top();
            pq.pop();
            string first = state.second.first, second = state.second.second;

            for (int i = 0; i < N; ++i) {
                pair<string, string> merged = first.empty() ? merge(S[i], second) : merge(first, S[i]);

                if (mergeStatus) {
                    if (!visited[merged]) {
                        dist[merged] = infiniteLL;
                    }

                    long long newDist = dist[state.second] + C[i];

                    if (newDist < dist[merged]) {
                        dist[merged] = newDist;
                        visited[merged] = true;
                        pq.push({newDist, merged});
                    }
                }
            }
        }

        calculateAnswer();

        if (answer >= infiniteLL) {
            answer = -1;
        }

        return answer;
    }

    void calculateAnswer() {
        answer = bestSingle;

        for (auto it : visited) {
            pair<string, string> p = it.first;

            if (p.first.empty() && p.second.empty()) {
                answer = min(answer, dist[p]);
            }

            if (p.first.empty() && isPalindrome(p.second)) {
                answer = min(answer, dist[p]);
            }

            if (p.second.empty() && isPalindrome(p.first)) {
                answer = min(answer, dist[p]);
            }
        }
    }
};

struct Task {
    int N;
    vector<string> S;
    vector<long long> C;

    void readInput() {
        N = readInt();
        S.resize(N);
        C.resize(N);

        for (int i = 0; i < N; ++i) {
            S[i] = readString();
            C[i] = readLongLong();
        }
    }

    void solve() {
        Graph graph;
        graph.initialize(N, S, C);
        long long dist = graph.solve();
        printf("%lld\n", dist);
    }

    void perform() {
        readInput();
        solve();
    }
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Task task;
    task.perform();

    return 0;
}

// Powered by PhoenixAI


Measured memory_bytes: 4152