#include <algorithm>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
static ll imin = std::numeric_limits<ll>::min() / 10;
static ll imax = std::numeric_limits<ll>::max() / 10;
#define rep(i, n) for (ll i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (ll i = 1; (i) < (n); ++(i))
#define rev_rep(i, n) for (ll i = (n)-1; (i) >= 0; --(i))
#define range(a, i, b) for (ll i = (a); (i) < (b); ++(i))

#ifdef LOCAL
#define dump(x) cout << #x << ":" << x << "\n";
#endif
#ifndef LOCAL
#define dump(x)
#endif

#define all(v) v.begin(), v.end()
#define readl(N)                                                               \
  ll N;                                                                        \
  cin >> N;
#define readlv(N, vec)                                                         \
  vector<ll> vec(N);                                                           \
  rep(i, N) { cin >> vec[i]; }
#define greater_than [](ll l, ll r) { return l > r; }
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair) {
  os << '(' << pair.first << ',' << pair.second << ')';
  return os;
}

template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec) {
  std::size_t n = vec.size();
  if (n == 0) {
    return os;
  }
  os << " ";
  for (ll i = 0; i < n - 1; ++i) {
    os << vec[i] << " ";
  }
  os << vec[n - 1];
  os << std::endl;
  return os;
}

template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp) {
  std::size_t n = mp.size();
  if (n == 0) {
    return os;
  }
  os << " ";
  for (auto &&x : mp) {
    os << x << " ";
  }
  os << std::endl;
  return os;
}

template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &mp) {
  std::size_t n = mp.size();
  if (n == 0) {
    return os;
  }
  os << " ";
  for (auto &&x : mp) {
    os << x << " ";
  }
  os << std::endl;
  return os;
}

template <class T> inline bool chmin(T &a, T const b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T const b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

ll fact(ll n) {
  ll res = 1;
  while (n > 0) {
    res *= n;
    n--;
  }
  return res;
}

ll pow(ll i, ll n) {
  ll res = 1;
  while (n >= 0) {
    res *= i;
    n--;
  }
  return res;
}

ll gcd(ll l, ll r) {
  if (l < r) {
    return gcd(r, l);
  }
  if (r == 0) {
    return l;
  }
  return gcd(r, l % r);
}

template <class T> vector<T> accum_sum(vector<T> const &a) {
  vector<T> b(a.size() + 1);
  b[0] = 0;
  rep(i, a.size()) { b[i + 1] = b[i] + a[i]; }
  return b;
}
constexpr ll mod = 1e9 + 7;

string s, t;
vector<vector<ll>> dp;
string bt(ll i, ll j) {
  dump(i);
  dump(j);
  if (i == 0 && j == 0) {
    if (s[i] == t[j]) {
      return string(1, s[0]);
    } else {
      return "";
    }
  }
  vector<string> cands;
  if (j != 0) {
    cands.push_back(bt(i, j - 1));
  }
  if (i != 0) {
    cands.push_back(bt(i - 1, j));
  }
  if (i != 0 && j != 0) {

    if (s[i] == t[j]) {
      cands.push_back(s[i] + bt(i - 1, j - 1));
    } else {
      cands.push_back(bt(i - 1, j - 1));
    }
  }
  sort(all(cands), [](string l, string r) { return l.size() > r.size(); });
  return cands[0];
}

int main(int argc, char const *argv[]) {
  cin >> s >> t;
  dp = vector<vector<ll>>(s.size() + 10, vector<ll>(t.size() + 10, 0));

  rep(i, s.size()) rep(j, t.size()) {
    if (s[i] == t[j]) {
      chmax(dp[i + 1][j + 1], dp[i][j] + 1);
    } else {
      chmax(dp[i + 1][j + 1], dp[i][j]);
    }
    chmax(dp[i + 1][j + 1], dp[i + 1][j]);
    chmax(dp[i + 1][j + 1], dp[i][j + 1]);
  }

  dump(dp);

  dump(dp[s.size()][t.size()]);
  // string res = bt(s.size(), t.size());
  // reverse(all(res));
  ll i = s.size(), j = t.size();
  string res;
  while (i > 0 && j > 0) {
    if (s[i - 1] == t[j - 1]) {
      res.push_back(s[i - 1]);
      i--;
      j--;
    } else if (dp[i][j] == dp[i - 1][j]) {
      i--;
    } else if (dp[i][j] == dp[i][j - 1]) {
      j--;
    }
  }
  reverse(all(res));
  cout << res << endl;
}


Measured memory_bytes: 71168