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 <iostream>
#include <cstring>
#include <cstdio>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)

const int MAX_D = 130;

struct Integer{
    Integer(int i = 0){
        memset(digits, 0, sizeof(digits));
        n = 0;

        while(i > 0){
            digits[n++] = i % 10;
            i /= 10;
        }
    }
    Integer(const std::string& s){
        memset(digits, 0, sizeof(digits));
        n = 0;

        bool f = false;
        for(int j=(int)s.size()-1;j>=0;j--){
            if(!std::isdigit(s[j])){continue;}

            if(s[j] != '0'){
                digits[n++] = s[j] - '0';
                f = true;
            }else if(f){
                digits[n++] = s[j] - '0';
            }
        }
    }
    int digits[MAX_D], n;
};

Integer operator*(const Integer& lhs, const Integer& rhs){
    Integer res;
    for(int i=0;i<MAX_D;i++){
        for(int j=0;j<MAX_D;j++){
            if(i + j >= MAX_D){continue;}
            int x = lhs.digits[i] * rhs.digits[j] + res.digits[i+j];
            res.digits[i+j] = x % 10;
            if(i + j + 1 < MAX_D){
                res.digits[i+j+1] += x / 10;
            }
        }
    }

    return res;
}

Integer operator+(const Integer& lhs, const Integer& rhs){
    Integer res;
    for(int i=0;i<MAX_D;i++){
        int x = lhs.digits[i] + rhs.digits[i] + res.digits[i];
        res.digits[i] = x % 10;
        if(i+1 < MAX_D){
            res.digits[i+1] = x / 10;
        }
    }

    return res;
}

int main(){
    int N;
    std::cin >> N;

    Integer x(100000), k1(105), k2(1000);
    REP(i, N){
        x = x * k1;
        
        FOR(j, 2, MAX_D){
            x.digits[j-2] = x.digits[j];
        }

        if(x.digits[0] || x.digits[1] || x.digits[2]){
            REP(i, 3){x.digits[i] = 0;}
            x = x + k2;
        }
    }

    bool f = false;
    for(int i=MAX_D-1;i>=0;i--){
        if(x.digits[i] != 0){
            f = true;
        }

        if(f){
            printf("%d", x.digits[i]);
        }
    }
    puts("");
}

C++: #include <iostream>
#include <cmath>

int main() {
	double m = 100;
	int n;

	std::cin >> n;
	for (int i = 0; i < n; ++i) {
		m *= 1.05;
		m = std::ceil(m);
	}
	std::cout << m * 1000 << std::endl;
	return 0;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

ll gcd(ll a, ll b)
{
  ll tmp;

  while(b){
    tmp = a;
    a = b;
    b = tmp%b;
  }

  return a;
}

inline ll lcm(ll a, ll b){ return a*(b/gcd(a, b)); }

ll a, b;

int main()
{
  while(cin >> a >> b){
    cout << gcd(a, b) << " " << lcm(a, b) << endl;
  }

  return 0;
}

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

int main()
{
    int n=0;
    int o=100000;
    
    cin >> n;
    
    for (int i=0; n != i; i++) {
        o = o*1.05;
        o = (o+999)/1000;
        o *= 1000;
    }
    
    cout << o << endl;
}

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

int main() {
    ios::sync_with_stdio(false);
    int x=100000, n;
    cin >> n;
    for(int i=0;i<n;i++){
      x *= 1.05;
      if(x%1000 == 0) ;
      else x = (x/1000)*1000 + 1000;
    }
    cout << x << endl;
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
int main(){

	int n,i,kane=100000,a,b;

	std::cin>>n;

	for(i=0;i<n;i++){
		kane=kane*1.05;
		if(kane%1000!=0){
			a=kane%1000;
			b=1000-a;
			kane=kane+b;
			}
		}
	
	std::cout<<kane;

		return 0;
		}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;

int main()
{
	string str = "";

	while (getline(cin, str)){
		int n = 0;
		stringstream ss(str);
		ss >> n;
		int roan = 100000;
	
		for (int i = 0; i < n; ++i){
			roan = (int)(roan*1.05);
		} // end for
		roan += 5000;
		roan = (roan/10000)*10000;
		cout << roan << endl;	
	} // end while

	return 0;
}

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

int main(){

	int n, i;
	double debt = 100000;
	cin >> n;

	for( i=0;i<n;i++ ){
		debt = debt * 1.05;

		debt /= 1000;
		debt = ceil( debt );
		debt *= 1000;

	}

	cout << debt << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
  int n;
  cin >> n;
  double x = 1e2;
  for (int i = 0; i < (int)n; ++i) x = ceil(x * 1.05);
  cout << ll(x * 1000) << endl;

  return 0;
}

C++: #include <iostream>
#include <cmath>

using namespace std;
int main() {
  int n;
  double money = 100000;
  cin >> n;
  for (int i = 0; i < n; i++) {
    money += money * 0.05;
  }
  cout << 10000 * ceil(money / 10000) << endl;
  return 0;
}

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

int main() {
	long long int N; cin >> N;
	long long int num = 100;
	while (N--) {
		num =num* 1.0499999999+1;
	}
	cout << num * 1000 << endl;
	return 0;
}

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

int main(){
	int debt =100000,n;
	cin >>n;

	while(n--){
		debt = (debt*105)/100;
		if((debt%1000)>0){
			debt += (1000 - debt%1000);
		}
	}

	cout << debt << endl;

    return 0;
}

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

int main()
{
	int n=0;
	cin>>n;
	long long c = 100000;
	for ( int i=0; i<n; i++ )
	{
		c += c/20;
		c = (c+999)/1000*1000;
	}
	cout << c << endl;
	return 0;
}

C++: #include  <iostream>
#include <math.h>
using namespace std;
int main(){
	int n ;
	double x = 100000;
	cin >> n;
	for( int i=0 ; i<n ; i++ ){
		x = x*1.05;
		x = x/1000;
		x = ceil(x);
		x = x*1000; 
	}
	cout << x << endl;
}

C++: a=100000;gets.to_i.times{a=a*105/100;a=(a/1000+1)*1000 if a%1000!=0;};puts a

C++: #include<iostream>
#include<string>

int Kiriage(double a)
{
	a /= 1000;

	int aI = a;

	if(a>aI)
	{
		aI += 1;
	}
	return aI*1000;
}

int main()
{
	int debt =100000;//ここ変更OK 最初の借入額

	int n;

	std::cin >> n;

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

		debt = Kiriage(debt);
	}

	std::cout << debt << '\n';

}

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

int main(){

	int n;
	
	while(cin>>n){

		int sum = 100000;


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

			sum *= 105/100.0;

			if((int)sum%1000>=100){
				sum /= 1000;
				sum *= 1000;
				sum += 1000;
			}
		}
		printf("%d\n",(int)sum);
	}
	return 0;
}