Go: package main

import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"math"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		debt := 100000 * math.Pow(1.05, float64(n))
		fmt.Println(math.Ceil(debt*0.0001)*10000)
	}
}

C++: 
#include <iostream>

using namespace std;

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

    int debt = 100; // *1000
    while(n--) {
        int r = debt % 20;
        debt += debt/20;
        if(r) ++debt;
    }
    cout << debt << "000" << endl;

    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	int money = 100000;
	int n;

	cin >> n;
	for(int i=0 ; i<n ; i++){
		money *= 1.05;
		if(money%1000 != 0){
			money += 1000 - (money%1000);
		}
	}
	cout << money << endl;
}

C++: #include <iostream>
#include <cmath>
#include <string>
using namespace std;

int main(){
    int n;
    cin >> n;
    int m = 100; // unit:k
    for(int i = 0; i < n; i++){
        m = (int)ceil(m * 1.05);
    }
    cout << m << "000" << endl;
    return 0;
}

C++: #include<iostream>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;

int main(){
  int n, debt = 100000;
  cin >> n;
  REP(i,n) {
    debt *= 1.05;
    if (debt % 1000 != 0) debt = (debt / 1000 + 1) * 1000;
  }
  cout << debt << endl;
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <utility>
#include <string>
typedef unsigned long ul;

using namespace std;

int main(){
	ul x, r, n;
	cin >> n;
	x = 100000;
	while(n--){
		x = x * 1.05;
		if((r = x % 1000) != 0){
			x = x + 1000 - r;
		}
	}
	cout << x << endl;
}

C++: #include<iostream>
using namespace std;

int main() {
    int d = 100000;
    int n;
    cin >> n;
    while(n--) {
        d *= 1.05;
        if(d % 1000) {
            d = (d / 1000 + 1) * 1000;
        }
    }
        cout << d << endl;
    return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
	int n;
	cin >> n;
	int a=100000;
	int b=0;
	for (int i=0;i<n;i++){
		b = a*1.05;
		if(b/1000.0-b/1000){
			a = (b/1000+1)*1000;}
		else 
			a = a*1.05;
	}
	cout << a << endl;

    return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main(void) {
    int n; cin >> n;
    double r = 1.05, q = 100000;
    for(int i = 0; i < n; i++) {
        q *= r;
        q = ceil(q / 1000) * 1000;
    }

    cout << (int)q << endl;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main(){
    int n;
    cin>>n;
    int total=100;
    double sum=0;
    for(int i=0;i<n;i++){
       sum=total*1.05;
       if((sum==(int)sum)) total=(int)sum;
       else total=(int)sum + 1; 
    }
    cout<<total<<"000"<< endl;
    return 0;
}

C++: #include<stdio.h>
int main(void) {
	int  a=100000,c;
	double b = 100000;
	scanf("%d", &c);
	for (int i = 0; i < c; i++)
	{
		b*= 1.05;
		a = b;
		if (a % 1000 != 0)
		{
			b = (b - (a % 1000)) + 1000;
		}
		a = b;
	}
	printf("%d\n",a);
	return 0;
}

C++: #include <iostream>
#include<math.h>
using namespace std;



int main(void){
	

	unsigned long int n, sum = 100000;
	long double Ceil;
	cin >> n;

	for (int i = 0; i < n; i++){

		sum /= 1000;
		Ceil = ceil(sum*1.05);
		sum=Ceil*1000;
	}		
	cout << sum << endl;


	
	return 0;
}

C++: //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;


// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion


// Effective std
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
#pragma endregion


// ?´???°
#pragma region PRIME
bool is_prime(unsigned n) {
  switch(n) {
    case 0:
    case 1: return false;
    case 2: return true;
  }
  if (n%2==0) return false;
  for (unsigned i=3; i*i<=n; i+=2)
    if (n%i==0) return false;
  return true;
}
#pragma endregion


// ??§??????/?°?????????????
#pragma region TRANSFORM
void mutal_tr(string &s) {
  for(int i=s.size(); i--;) {
    if(islower(s[i])) s[i] = toupper(s[i]);
    else if (isupper(s[i])) s[i] = tolower(s[i]);
  }
}
void to_upper(string &s) { for(int i=s.size(); i--;) s[i] = toupper(s[i]); }
void to_lower(string &s) { for(int i=s.size(); i--;) s[i] = tolower(s[i]); }
#pragma endregion


// ??????
#pragma region SET
template<class T>
set<T> intersection(const set<T>& sa, const set<T>& sb) {
  set<T> ret;
  for(T a : sa) if(sb.find(a) != sb.end()) ret.insert(a);
  return ret;
}
#pragma endregion

// Union Find
#pragma region UF
struct UnionFind {
  vector<int> data;
  UnionFind(int size) : data(size, -1) {}
  bool union_set(int x, int y) {
    x = root(x); y = root(y);
    if(x!=y) {
      if(data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool find_set(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};
#pragma endregion


// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion

int main()
{
    int n;
    cin >> n;
    ll ans = 100000;
    rep(i,n) {
        ans += ans*0.05;
        if(ans%1000!=0) {
            ans /= 1000;
            ans *= 1000;
            ans += 1000;
        }

    }
    P(ans);
    return 0;
}

C++: //0007
#include <bits/stdc++.h>
using namespace std;
int money = 100000;
void up() {
    int judge = money % 10000;
    if(judge >= 1) {
        money -= judge; money += 10000;
    }
}

int main(void) {
    int n; cin >> n;
    for(int r = 0; r < n; r++) {
        money *= 1.05;
    }
    up();
    cout << money << endl;
    return(0);
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n;
	int a;
	int out;
	
	cin >> n;
	for(int i = 0; i < n; i++){
		n = n * 1.05;
	}
	n = 100000 + n*1000*5;
	a = n / 10000;
	if(n % 10000 == 0){
		out = a * 10000;
	}
	else{
		out = (a+1) * 10000;
	}
	cout << out  << endl;
	cout << n << endl;
	return 0;
}