#include <iostream>
using std::cerr, std::cin, std::cout, std::endl, std::fixed, std::flush;
#include <string>
using std::stoi, std::stol, std::string, std::to_string;
#include <algorithm>
using std::clamp, std::ranges::count, std::ranges::count_if, std::ranges::fill, std::ranges::find, std::ranges::find_if;
using std::ranges::is_permutation, std::ranges::lower_bound, std::ranges::max, std::ranges::max_element, std::ranges::min;
using std::ranges::min_element, std::ranges::next_permutation, std::ranges::prev_permutation, std::swap_ranges;
using std::ranges::reverse, std::ranges::rotate, std::ranges::sort, std::ranges::unique, std::ranges::upper_bound;
static_assert(sizeof(long) == 8);
#pragma GCC optimize("O3")
int main()
{
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long N;
  cin >> N;
  long M = N * (1000000000 / N + 1);
  long L = M / 10;
  while (1)
  {
    if (M % 10 != 9)
    {
      M += N;
      L = M / 10;
      continue;
    }
    string S = to_string(L);
    string T = S;
    reverse(T);
    if (S == T)
    {
      cout << L * 10 + 9 << '\n';
      return 0;
    }
    L += N;
  }
  return 0;
}
/*
  File : ~/kyopro/yukicoder/a.cpp
  Date : 2025/09/01
  Time : 05:10:33
*/