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;
template <class T>
void chmin(T &t, T f) {
  if (t > f) t = f;
}
template <class T>
void chmax(T &t, T f) {
  if (t < f) t = f;
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T sqr(T x) {
  return x * x;
}
template <typename T>
T cube(T x) {
  return x * x * x;
}
string out(long long x) {
  stringstream ss;
  ss << x;
  string res;
  ss >> res;
  return res;
}
long long out(string s) {
  stringstream ss;
  ss << s;
  long long res;
  ss >> res;
  return res;
}
long long fact(int n) { return n ? n * fact(n - 1) : 1; }
template <typename T>
void print(const vector<vector<T> > &v) {
  for (int i = 0; i < (int)(v.size()); i++) {
    cout << "i = " << i << endl;
    for (int j = 0; j < (int)(v[i].size()); j++) {
      cout << v[i][j] << ' ';
    }
    cout << endl;
    cout << endl;
  }
}
template <typename T>
void print(const vector<T> &v) {
  for (int i = 0; i < (int)(v.size()); i++) {
    cout << v[i] << ' ';
  }
  cout << endl;
}
int t1, t2, x1, x2, t0;
long long func(long long y1, long long y2) {
  return (t1 * y1 + t2 * y2) - t0 * (y1 + y2);
}
vector<int> z_function(string s) {
  int n = (int)s.length();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
void no() {
  cout << "Just a legend" << endl;
  exit(0);
}
int main() {
  string s;
  cin >> s;
  vector<int> z = z_function(s);
  set<int> maxMiddle;
  int n = s.size();
  for (int i = 1; i < n; i++) {
    maxMiddle.insert(min(z[i], n - i - 1));
  }
  maxMiddle.erase(0);
  set<int> resSize;
  for (int i = z.size() - 1; i; i--) {
    int tmp = n - i;
    if (z[i] == tmp) {
      resSize.insert(tmp);
    }
  }
  resSize.erase(0);
  vector<int> mm(maxMiddle.begin(), maxMiddle.end());
  vector<int> sp(resSize.begin(), resSize.end());
  for (int i = (int)(sp.size()) - 1; i >= 0; i--) {
    if (lower_bound(mm.begin(), mm.end(), sp[i]) != mm.end()) {
      cout << s.substr(0, sp[i]) << endl;
      return 0;
    }
  }
  no();
  return 0;
}