Билет в один конец

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define mp make_pair

const int maxn = 66667;
ll d[maxn];
vector <ll> j;

void plas(ll N, ll K)
{
    ll n;
    ll sum = 0;
    ll k = K;
    j.push_back(k);
    ll l = max(int(j.size()), 1)-1;
    d[k] = l;
    l++;
    for (int i=l+1; i <= N+l; i++)
    {
        sum = 0;
        n = k;
        while (n != 0) {
            sum += (n % 10) * (n % 10) * (n % 10);
            n /= 10;
        }
        k = sum;
        d[sum] = i;
        j.push_back(sum);
    }
}

int main()
{
    ll n;
    cin >> n;
    if (n == 2)
        cout << 10;
    else
    {
        for (int i = 0; i < ceil(n / 2.0)-1; i++)
        {
            cout << "1";
        }
        cout << "0";
        for (int i = 0; i < ceil(n / 2.0) - 2; i++)
        {
            cout << "8";
        }
        cout << "90";
    }
    system("pause");
    return 0;
}