#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <list>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
#define for1(i,n) for (ll i=0;i<(n);i++)
#define for2(i,m,n) for (ll i=(m);i<(n);i++)
#define for3(i,m,n,d) for (ll i=(m);i<(n);i+=(d))
#define DEBUG 0
const ll MOD = 1000000007;
template <class T>
void dumplist(T list)
{
    for (auto item : list) {
        cout << item << " ";
    }
    cout << endl;
}
ll add(ll a, ll b)
{
    return (a + b) % MOD;
}
ll sub(ll a, ll b)
{
    return (a + MOD - b) % MOD;
}
ll mul(ll a, ll b)
{
    return ((a % MOD) * (b % MOD)) % MOD;
}
ll power(ll x, ll y)
{
    if (y == 0) {
        return 1;
    }
    else if (y == 1) {
        return x % MOD;
    }
    else if (y % 2 == 0) {
        ll t = power(x, y / 2);
        return mul(t, t);
    }
    else {
        ll t = power(x, y / 2);
        return mul(mul(t, t), x);
    }
}
ll div(ll a, ll b)
{
    return mul(a, power(b, MOD - 2));
}


void solve()
{
    ll N;
    cin >> N;

    cout << N*10 << endl;
}

int main()
{
    do {
        solve();
    } while (DEBUG);
}