#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));
template <typename T>
struct starry_sky_tree
{
    T size;
    vector<T> data;
    vector<T> lazy;
    vector<T> width;

    starry_sky_tree(T n)
    {
        size = 1;
        while (size < n)
            size <<= 1;
        data.resize(size * 2, 0);
        lazy.resize(size * 2, 0);
        width.resize(size * 2, 1);
        for (T i = size - 2; i >= 0; i--)
        {
            width[i] = width[i * 2 + 1] + width[i * 2 + 2];
        }
    }

    void lazy_propagate(T p)
    {
        data[p] += lazy[p];
        if (p < size - 1)
        {
            lazy[p * 2 + 1] += lazy[p];
            lazy[p * 2 + 2] += lazy[p];
        }
        lazy[p] = 0;
    }

    void add(T wishl, T wishr, T x)
    {
        add(wishl, wishr, 0, size, 0, x);
    }
    void add(T wishl, T wishr, T watchl, T watchr, T k, T x)
    {
        if (wishr <= watchl || watchr <= wishl)
        {
            lazy_propagate(k);
            return;
        }
        if (wishl <= watchl && watchr <= wishr)
        {
            lazy[k] += x;
            lazy_propagate(k);
            return;
        }

        T mid = (watchl + watchr) / 2;
        lazy_propagate(k);
        add(wishl, wishr, watchl, mid, k * 2 + 1, x);
        add(wishl, wishr, mid, watchr, k * 2 + 2, x);
        data[k] = min(data[k * 2 + 1], data[k * 2 + 2]);
    }

    T getmin(T wishl, T wishr)
    {
        return getmin(wishl, wishr, 0, size, 0);
    }
    T getmin(T wishl, T wishr, T watchl, T watchr, T k)
    {
        if (wishr <= watchl || watchr <= wishl)
            return 0;
        if (wishl <= watchl && watchr <= wishr)
        {
            lazy_propagate(k);
            return data[k];
        }

        T mid = (watchl + watchr) / 2;
        T L = getmin(wishl, wishr, watchl, mid, k * 2 + 1);
        T R = getmin(wishl, wishr, mid, watchr, k * 2 + 2);
        return min(L, R);
    }
};
int main()
{
    cout << fixed << setprecision(30);
    ll x,a;
  cin>>x>>a;
  if(x<a)putout(0);
  else putout(10);
    return 0;
}


Measured memory_bytes: 3600