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>
#pragma GCC optimize("O3")
const int inf = 0x3f3f3f3f;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long power(long long a, long long b, long long m = 1000000007) {
  long long answer = 1;
  while (b) {
    if (b & 1) answer = (answer * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return answer;
}
using namespace std;
vector<int> z_function(string second) {
  int n = (int)second.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 && second[z[i]] == second[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
int pi[1000000 + 5];
void kmpPreprocess(string &P) {
  int i = 0, j = -1, m = P.size();
  pi[0] = -1;
  while (i < m) {
    while (j >= 0 and P[i] != P[j]) j = pi[j];
    i++, j++;
    pi[i] = j;
  }
}
int main() {
  string p;
  cin >> p;
  vector<int> z;
  z = z_function(p);
  kmpPreprocess(p);
  int mx = 0;
  string h = "";
  int n = p.length();
  bool flag = true;
  if (pi[n] == 0) {
    cout << "Just a legend\n";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (pi[n] == pi[i]) {
      for (int j = 0; j < pi[i]; j++) cout << p[j];
      return 0;
    }
  }
  if (pi[pi[n]] == 0) {
    cout << "Just a legend\n";
    return 0;
  }
  for (int i = 0; i < pi[pi[n]]; i++) cout << p[i];
  return 0;
}