Go: package main
import (
	"fmt"
	"os"
	"strconv"
	"bufio"
	"math"
)

var sc = bufio.NewScanner(os.Stdin)

func main(){
	sc.Split(bufio.ScanWords)
	n := nextInt()
	ans := calc(n)
	fmt.Println(ans)
}

func calc(n int) float64{
	tmp := 100000.0
	for i:=0; i<n; i++{
		tmp*=1.05
		// tmp = Ceil(tmp, -4) なぜかうまくいかない
		tmp = Ceil(tmp, -3)
		// fmt.Printf("now tmp: %d\n", int(tmp))
	}
	return tmp
}

func Ceil(f float64, places int) float64{
	shift := math.Pow(10, float64(places))
	return math.Ceil(f * shift)/shift
}

func next()string{
	sc.Scan()
	return sc.Text()
}

func nextInt()int{
	a, _ := strconv.Atoi(next())
	return a
}

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

int main(){
  int money = 100000, n;
  cin >> n;
  for(int i = 0;i < n;i++){
    money *= 1.05;
    if(money % 1000 > 0) {
      money -= money % 1000;
      money += 1000;
    }
  }

  cout << money << "\n";
  return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int main() {
	long long n, ans = 100000;
	cin >> n;
	while (--n) { ans = (ans + ans / 20 + 999) / 1000 * 1000; }
	cout << ans << endl;
}

C++: #include<iostream>
using namespace std;
int main(){
	int n,debt = 100000;
	cin >>n;
	for(int i=0; i<n; i++){
		debt *=1.05;
		int k = debt/1000*1000;
		if(debt != k){debt = k+1000;}
	}
	cout <<debt<<endl;
	return 0;
}

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

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

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
  int n,ten=100000,ten2;
  cin>>n;
  rep(i,n)ten+=5000;
  ten2=ten/10000*10000;
  if(ten!=ten2)ten+=5000;
  cout<<ten<<endl;
}

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

int main(void){

	int n, money;
	cin>>n;
	money = 100000;
	for (int i=0; i<n; i++){
		money = ceil(((double)money * 1.05)/1000)*1000;
	}
	cout<<money<<endl;
	return 0;
}

C++: #include <cstdio>

const int DEBT = 100000;

int main(int argc, char *argv[]) {
	int week;
	double sumDebt = static_cast<double>(DEBT);
	fscanf(stdin, "%d", &week);
	
	for (int i = 0; i < week; i++) {
		sumDebt += sumDebt * 0.05;
		sumDebt = static_cast<int>(sumDebt);
		int hasu = static_cast<int>(sumDebt) % 1000;
		if (hasu > 0) {
			sumDebt = sumDebt - hasu + 1000;
		}
		//printf("%d week is %.3f\n", i, sumDebt);
	}
	printf("%d\n", static_cast<int>(sumDebt));
	return 0;
}

C++: #include <iostream>

int main(){
	int n,debt=100000;
	for(int i=0;i<(std::cin>>n);i++) debt*=1.05;
	std::cout<<(debt%1000 ? debt/1000*1000+1000 : debt)<<'\n';
	return 0;
}

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

int main(void){
	int n = 0;
	cin >> n;

	const double inter = 0.05;
	double debt = 100000.0;
	int a = 0;

	for(int i = 0;i < n;i++){
		debt += debt * inter;
		a = (int)debt%1000;
		if(a != 0){
			debt += 1000.0 - (double)a;
		}
	}

	cout << (int)debt << endl;

	return 0;
}

C++: #include<iostream>
int main(){
 int a,n,i;
	a=100000;
	std::cin>>n;
	for(i=0;i<n;i++){
		a=a*1.05;
		if(a%1000!=0){
			a=a-a%1000;
			a=a+1000;
		
			std::cout<<a<<std::endl;
		}			
	}
return 0;
}

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

const double BORROWING_AMOUNT = 100000;

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

    double value = BORROWING_AMOUNT;
    for (int i = 1; i <= n; ++i) {
        value += value * 0.05;
        int mod = (int) value % 1000;
        if (mod > 0) {
            value += 1000 - mod;
        }
    }
    cout << value << endl;

    return 0;
}

C++: 

#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
int main()
{long long a = 100000;
	int s;
	cin >> s;
	for (int i = 0; i < s; i++) {
		a *= 1.05;
	}
	if (a % 1000 == 0) {
		
	}
	else { a = a - (a % 1000); }
	cout << a; return 0;

}

C++: #include<iostream>
//#define DEBT 100000

using namespace std;

main(){
int inNum,i;
int debt = 100000;

cin>>inNum;
cout<<"amount of the debt"<<endl;
for(i = 0; i <= inNum; i++){
debt*=1.05;
}
debt/=10000;
debt*=10000;
cout<<debt<<endl;
}

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

int main(){
    int ans = 100000;
    int n;
    cin >> n;
    for(int i=0;i<n;i++){
        ans += ans*0.05;
        if(ans%1000!=0)
            ans = ans-ans%1000 + 1000;
    }
    cout << ans << endl;

    return 0;
}

C++: #include <stdio.h>

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

	scanf("%d", &n);
	for(int i=0 ; i<n ; i++){
		money += 100000.0 * 0.05;
		money += 1000 - (money%1000);
	}
	printf("%d", money);

	return 0;
}

C++: #include<iostream>

using namespace std;

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

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

#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)

int main(int argc, char *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, ret = 100000;
    cin >> n;

    REP(i, n)
    {
        ret = ret * 1.05;
        ret = (ret % 1000 == 0 ? ret : ret - ret % 1000 + 1000);
    }

    cout << ret << endl;

    return 0;
}

C++: #include <iostream>
#include<stdio.h>
using namespace std;
int main(void) {
	int a,n,i;
	int x=100000;
	scanf("%d",&n);
	for(i=0;i<n;i++){
	    x=x*105/100;
	    if(x%1000!=0){
	        a=(x/1000)+1;
	        x=a*1000;
	    }
            else{
               x=x;}
	}
	cout<<x<<endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>

#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)


using namespace std;


int main(void)
{
    int n;
    long long money = 100000;
    int keta = 1;
    int judge = 1;
    double temp;
    cin >> n ;
    FOR(i, 1,n+1 )
    {
        money+= 0.05*money;
        temp = money;
        while(judge)
        {
            temp = (int)temp /10;
            if (temp) {
                keta++;
            }else
                judge = 0;
        }
        
        REP(i,3)
        money = money /10;
        money = ceil(money);
        //cout << money << endl;
        REP(i, 3)
        money = money*10;
        keta = 0;
        judge = 1;
    }
    
    
    cout << money << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int n, k = 100000;

	cin >> n;

	for (int i = 1; i <= n; i++)
	{
		k = static_cast<int>(k * 1.05 + 999) / 1000 * 1000;
	}

	cout << k << endl;

	return 0;
}