#include <bits/stdc++.h>
using namespace std;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
const ll INF = 1LL << 50;
template <typename T>
T sq(T a) {
  return a * a;
}
template <typename T>
T gcd(T a, T b) {
  if (a > b) return gcd(b, a);
  return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
  if (n == 0) return 1;
  if (n == 1) return b;
  if (n % 2 == 0) {
    return mypow(sq(b), n / 2);
  } else {
    return mypow(b, n - 1) * b;
  }
}
ll pcnt(ll b) { return __builtin_popcountll(b); }
ll c[1010], s[1010];
void solve() {
  ll N;
  cin >> N;
  for (ll i = (1); i < (N + 1); ++i) {
    string S;
    cin >> c[i];
    cin >> S;
    s[i] = 0;
    for (char c : S) {
      s[i] |= (1 << (c - 'A'));
    }
  }
  ll dp[N + 1][8];
  fill(dp[0], dp[1], INF);
  dp[0][0] = 0;
  for (ll i = (1); i < (N + 1); ++i) {
    for (ll k = (0); k < (8); ++k) {
      dp[i][k] = dp[i - 1][k];
    }
    for (ll k = (0); k < (8); ++k) {
      dp[i][k | s[i]] = min(dp[i][k | s[i]], dp[i - 1][k] + c[i]);
    }
  }
  cout << (dp[N][7] < INF ? dp[N][7] : -1) << endl;
  return;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
