#include<bits/stdc++.h>
using namespace std;

template<typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "{";
    typename vector<T>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << *it;
    }
    return os << "}";
}

template<typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
    os << "[";
    typename set<T>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << *it;
    }
    return os << "]";
}

template<typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
    os << "[";
    typename map<F, S>::const_iterator it;
    for (it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) os << ", ";
        os << it->first << " = " << it->second;
    }
    return os << "]";
}

#define debug(x) cout << #x << " = " << x << endl;
#define trace1(x)                cout<<#x<<": "<<x<<endl
#define trace2(x, y)             cout<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cout<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cout<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl


typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef map<int, int> mii;
typedef vector< pair<int, int> > vpii;

#define endl "\n";
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define tr(cont, it) for(decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end())
#define F first
#define S second

const ll mod = 1000000007;
const ll inf = (ll) 1e15;

ll power(ll a, ll b, ll m = mod) {if (b == 0) return 1; if (b == 1) return (a % m); ll x = power(a, b / 2, m); x = (x * x) % m; if (b % 2) x = (x * a) % m;return x;}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }

const int N=3005,M=1e5+5;

string s1,s2;
int dp[N][N],trk[N][N];
bool memo[N][N];
int n1,n2;

int func(int idx1,int idx2)
{
    if(idx1>=n1||idx2>=n2)
        return 0;
    if(memo[idx1][idx2])
        return dp[idx1][idx2];
    memo[idx1][idx2]=true;
    int ret=0;
    if(s1[idx1]==s2[idx2])
    {
        ret=max(ret,1+func(idx1+1,idx2+1));
        trk[idx1][idx2]=1;
    }
    int val1=func(idx1+1,idx2);
    int val2=func(idx1,idx2+1);
    if(val1>ret)
    {
        ret=val1;
        trk[idx1][idx2]=2;
    }
    if(val2>ret)
    {
        ret=val2;
        trk[idx1][idx2]=3;
    }
    return dp[idx1][idx2]=ret;
}

void call(int idx1,int idx2)
{
    if(idx1>=n1 || idx2>=n2 || trk[idx1][idx2]==0)
        return;
    if(trk[idx1][idx2]==1)
    {
        cout << s1[idx1];
        call(idx1+1,idx2+1);
        return;
    }
    if(trk[idx1][idx2]==2)
    {
        call(idx1+1,idx2);
        return;
    }
    if(trk[idx1][idx2]==3)
    {
        call(idx1,idx2+1);
        return;
    }

}
void solve() {

    cin >> s1 >> s2;
    n1=s1.size();
    n2=s2.size();
    int ans=func(0,0);
    //cout << ans << endl;
    call(0,0);
}

int main() {
    IOS;
    int t = 1, num = 1;   ///// change this t for number of testcase globally
    while (t--) {
        solve();
    }
    return 0;
}


Measured memory_bytes: 80000