//全探索
//TLEするかどうか
#include <iostream>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
//#define endl "\n";
ll N, num[20], ten[20];

//10^18までしかできないのでketaは9まで
void dfs(ll val, ll keta, ll tasu){
  if(keta >= 5){
    //check
    ll chk = val * ten[keta] + (tasu % ten[keta - 1]) * 10 + 9;
    if(chk % N == 0){
      cout << chk << endl;
      exit(0);
    }
    if(keta < 9){
      chk = val * ten[keta + 1] + (tasu % ten[keta]) * 10 + 9;
      if(chk % N == 0){
        cout << chk << endl;
        exit(0);
      }
    }
  }
  if(keta >= 9) return;
  for(ll i = (keta == 0 ? 1: 0); i <= 9; i++){
    num[keta] = i;
    dfs(val * 10 + i, keta + 1, tasu + i * ten[keta]);
    num[keta] = 0;
  }
}

int main(){
  cin >> N;
  ten[0] = 1;
  for(int i = 1; i <= 18; i++) ten[i] = ten[i - 1] * 10;
  dfs(0, 0, 0);
  return 0;
}