Problem: Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.

A little later they found a string s, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring t of the string s.

Prefix supposed that the substring t is the beginning of the string s; Suffix supposed that the substring t should be the end of the string s; and Obelix supposed that t should be located somewhere inside the string s, that is, t is neither its beginning, nor its end.

Asterix chose the substring t so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring t aloud, the temple doors opened. 

You know the string s. Find the substring t or determine that such substring does not exist and all that's been written above is just a nice legend.

Input

You are given the string s whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters.

Output

Print the string t. If a suitable t string does not exist, then print "Just a legend" without the quotes.

Examples

Input

fixprefixsuffix


Output

fix

Input

abcdabc


Output

Just a legend

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-9;
const int INF = 2e9;
const long long LINF = 1e18;
template <class T>
const T sqr(const T &x) {
  return x * x;
}
template <class T>
const T &min(const T &a, const T &b, const T &c) {
  return min(min(a, b), c);
}
template <class T>
const T &max(const T &a, const T &b, const T &c) {
  return max(max(a, b), c);
}
struct DbgStream {
  template <class T>
  DbgStream &operator<<(const T &x) {
    return *this;
  }
} z_dbg;
struct SingleHash {
  vector<int> suf, b;
  int mod;
  SingleHash(string s, int base = 153, int _mod = 1000000009) {
    int n = s.length();
    suf.assign(n + 1, 0);
    b.assign(n + 1, 0);
    b[0] = 1;
    b[1] = base;
    mod = _mod;
    for (int i = n - 1; i >= 0; --i) {
      suf[i] = (s[i] + (long long)suf[i + 1] * b[1]) % mod;
    }
    for (int i = 2; i <= n; ++i) {
      b[i] = (long long)b[i - 1] * b[1] % mod;
    }
  }
  int substr(int l, int r) const {
    long long v = suf[l] - (long long)suf[r + 1] * b[r - l + 1];
    v %= mod;
    v += mod;
    v %= mod;
    return v;
  }
};
bool check(int m, int n, const SingleHash &h) {
  int pref = h.substr(0, m - 1);
  for (int i = 1; i + m < n; ++i) {
    if (pref == h.substr(i, i + m - 1)) {
      return 1;
    }
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  string s;
  cin >> s;
  SingleHash h(s);
  n = s.length();
  vector<int> lens;
  lens.reserve(n);
  for (int i = 1; i < n; ++i) {
    if (h.substr(0, i - 1) == h.substr(n - i, n - 1)) {
      lens.push_back(i);
    }
  }
  int l = 0, r = lens.size();
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (check(lens[m], n, h)) {
      l = m;
    } else {
      r = m;
    }
  }
  if (lens.empty() || !check(lens[l], n, h)) {
    cout << "Just a legend\n";
    return 0;
  }
  for (int i = 0; i < lens[l]; ++i) {
    cout << s[i];
  }
  cout << "\n";
  return 0;
}