/* author: jeetganatra */

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define ld              long double
#define pb              push_back
#define mp              make_pair
#define fo(i,n)         for(int i=0;i<n;i++)
#define Fo(i,k,n)       for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define tr(it, a)       for(auto it = a.begin(); it != a.end(); it++)
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define pw(b,p)         pow(b,p) + 0.1
#define deb(x)          cout << #x << "=" << x << endl
#define deb2(x, y)      cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x)          x.begin(), x.end()
#define clr(x)          memset(x, 0, sizeof(x))
#define sortall(x)      sort(all(x))
#define PI              3.14159265
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


void jpg()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int mpow(int base, int exp);
int nCr(int n, int r, int p);



int32_t main()
{
   // jpg();
    // w(t)
    // {
    int n; cin >> n;
    int calc = 1.08 * n;
    if (calc < 206)
        cout << "Yay!";
    else if (calc == 206)
        cout << "so-so";
    else
        cout << ":(";

    // }

}

int mpow(int base, int exp) {
    base %= mod;
    int result = 1;
    while (exp > 0) {
        if (exp & 1) result = ((int)result * base) % mod;
        base = ((int)base * base) % mod;
        exp >>= 1;
    }
    return result;
}

int nCr(int n, int r, int p)
{
    if (r > n - r)
        r = n - r;

    int C[r + 1];
    memset(C, 0, sizeof(C));

    C[0] = 1;

    for (int i = 1; i <= n; i++) {
        for (int j = min(i, r); j > 0; j--)
            C[j] = (C[j] + C[j - 1]) % p;
    }
    return C[r];
}




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

int main() {
    int64_t n;
    cin >> n;

    if (n < 1000) {
        cout << 0 << endl;
    }
    else if (n < 1000000) {
        int64_t ans = 1 * (n - 999);
        cout << ans << endl;
    }
    else if (n < 1000000000) {
        int64_t ans = 0;
        ans += 1 * (999999 - 999);
        ans += 2 * (n - 999999);
        cout << ans << endl;
    }
    else if (n < 1000000000000) {
        int64_t ans = 0;
        ans += 1 * (999999 - 999);
        ans += 2 * (999999999 - 999999);
        ans += 3 * (n - 999999999);
        cout << ans << endl;
    }
    else if (n < 1000000000000000) {
        int64_t ans = 0;
        ans += 1 * (999999 - 999);
        ans += 2 * (999999999 - 999999);
        ans += 3 * (999999999999 - 999999999);
        ans += 4 * (n - 999999999999);
        cout << ans << endl;
    }
    else {
        int64_t ans = 0;
        ans += 1 * (999999 - 999);
        ans += 2 * (999999999 - 999999);
        ans += 3 * (999999999999 - 999999999);
        ans += 4 * (999999999999999 - 999999999999);
        ans += 5;
        cout << ans << endl;
    }
}
