Problem: You are given a string s consisting of |s| small english letters.

In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter.

Your target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible.

Input

The only one line of the input consisting of the string s consisting of |s| (1 ≤ |s| ≤ 105) small english letters.

Output

If you can get a string that can be obtained from the given string and will contain english alphabet as a subsequence, print it. Otherwise print «-1» (without quotes).

Examples

Input

aacceeggiikkmmooqqssuuwwyy


Output

abcdefghijklmnopqrstuvwxyz


Input

thereisnoanswer


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct compare {
  bool operator()(const int64_t &a, const int64_t &b) { return a > b; }
};
bool customS(pair<int64_t, int> a, pair<int64_t, int> b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
bool customS2(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
  return a.second < b.second;
}
class CompareDist {
 public:
  bool operator()(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
    return a.first < b.first;
  }
};
int64_t gcd(int64_t a, int64_t b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
double gcdfloat(double a, double b) {
  if (a < b) return gcd(b, a);
  if (fabs(b) < 0.001)
    return a;
  else
    return (gcd(b, a - floor(a / b) * b));
}
void DFS(int64_t start, vector<vector<int64_t> > &nodes,
         vector<int64_t> &visited, int64_t *a, int64_t *b, int64_t ctr) {
  visited[start] = 1;
  if (ctr % 2 == 0)
    *a = *a + 1;
  else
    *b = *b + 1;
  for (int i = 0; i < nodes[start].size(); i++) {
    if (visited[nodes[start][i]] == 0) {
      DFS(nodes[start][i], nodes, visited, a, b, ctr + 1);
    }
  }
}
int64_t LCA(int64_t a, int64_t b) {
  while (a != b) {
    if (b > a) {
      swap(a, b);
    }
    a /= 2;
  }
  return a;
}
vector<int64_t> ra(int64_t n) {
  vector<int64_t> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  return arr;
}
int64_t binary_search_lower(vector<int64_t> &arr, int64_t n) {
  int64_t low = 0, high = arr.size() - 1, mid, ans = -1;
  while (low <= high) {
    mid = (low + high) / 2;
    if (arr[mid] <= n) {
      ans = mid;
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  return ans;
}
int64_t binary_search_upper(vector<int64_t> &arr, int64_t n) {
  int64_t low = 0, high = arr.size() - 1, mid, ans = -1;
  while (low <= high) {
    mid = (low + high) / 2;
    if (arr[mid] >= n) {
      ans = mid;
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int64_t i, j, a = 0, b = 0, c = 0, d = 0, n, m, k, sum = 0, x = 0, y = 0,
                z = 0, flag = 0, zero = 0, ans = 0;
  int64_t mod = 1000000007;
  string s, newS, s2;
  double dn;
  cin >> s;
  char ch = 'a';
  for (i = 0; i < s.length(); i++) {
    if (s[i] <= ch) {
      s[i] = ch;
      ch++;
      if (ch > 'z') break;
    }
  }
  if (ch > 'z')
    cout << s << "\n";
  else
    cout << -1 << "\n";
  return 0;
}