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>
using namespace std;

int main(){
	int n;
	cin >> n;
	int c = 100;
	for(int i=0; i<n; i++){
		c = (c*105+99)/100;
	}
	cout << c*1000 << endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

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

  cin >> n;

  for(int i=0; i<n;i++){
	debt *= 1.05;
	if(debt % 1000) debt += (1000-(debt % 1000));
  }

  cout << debt << endl;
}

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

// advance_nはansのn桁目以降が0出なければ切り上げ、0ならそのままにする
//  12000 12345 - (12345 % 10^3
int advance_n(int ans,int n)
{
	cout << "ans % int(pow(10,n+2)))10=" << ans % int(pow(10,n)) << endl;
	cout << "pow(10,n+2)=" << pow(10,n+2) << endl;
	cout << "(ans - ans % int(pow(10,n+2)))=" << (ans - ans % int(pow(10,n+2))) << endl;
	return (ans - ans % int(pow(10,n)) + (ans % int(pow(10,n+2)) != 0)*int(pow(10,n)));
}

int how_much_debt(int n)
{
	if (n==0)
		return 100000;
	else
		return 1.05 * how_much_debt(n-1);
}

int main()
{
	int a;
	cin >> a;
	cout << advance_n(how_much_debt(a),4) << endl;
}

C++: #include <iostream>

using namespace std;

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

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

int main(){
	double money = 100000;
	int n;
	cin >> n;
	for( int i=0; i<n; i++ ){
		money = money * 1.05;
		int up = (int)(money / 1000.0);
		if( (int)money%1000 > 0 ){
			money = (up+1)*1000.0;
		}else{
			money = up * 1000.0;
		}
	}
	cout << (int)money << endl;
	return 0;
}

C++: #include<iostream>
#include<stdio.h>

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

	
	
	return 0;
	}

C++: #include <iostream>

using namespace std;

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

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

int main() {
  int n, d = 100000;
  cin >> n;
  for (int i = 0; i < n; i++) {
    d = d * 105 / 100;
    if (d % 1000) {
      d = (d / 1000 + 1) * 1000;
    }
  }
  cout << d << endl;
  return 0;
}

C++: #include <iostream>
#include <math.h>
using namespace std;
 
void test();
int interest(int debt, double interest_rate,int n);
 
 
int main(void)
{
    test();
    return 0;
}
 
void test()
{
    int debt,n;
    debt = 100000;
    cin >> n;
 
    debt = interest(debt, 1.05, n) ;
 
    if (debt % 1000 > 0)
    {
        debt = debt - (int)debt % 1000 + 1000;
    }
     
    cout << debt << endl;
}
 
int interest(int debt, double interest_rate,int n)
{
 
    if (n == 0)
        return debt * interest_rate;
    else
        return ceil(interest(debt, interest_rate, n - 1) * interest_rate);
}

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

C++: #include<stdio.h>
int main(void)
{
	int a,s,d,f,g,i;
	s=100000;
	scanf("%d",&a);
	for(i=1;i<=a+1;i++){
	s=s+d;
		d=(s/100)*5;
		if(d%1000!=0){
			g=d/1000;
			d=(g+1)*1000;
		}
	}
	printf("%d\n",s);
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	float a,n,i,b,j,ans=0;
	a=100000;
	cin>>n;
	for(i=1;i<=n;i++){
		a=a*1.05;
	}
	for(i=1;1000<=a;i++){
		a=a-1000;
	}i=i-1;
	ans=i*1000;
	if(a==0){
	}else{
		ans=ans+1000;
	}
	cout<<ans<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){int n,m=1e5;
for(cin>>n;n>0;n--)m=(m*105/100+999)/1e3*1e3;
cout<<m<<endl;
return 0;}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const double INF = 1e12;

LL gcd(LL a,LL b){
	if(b==0)return a;
	return gcd(b,a%b);
}

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

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

int main(void){
    int i,n;
    double ans;
    cin >> n;
    ans=100.000;
    for(i=0;i<n;i++){
        ans*=1.05;
        ans=(int)(ans+0.999);
        ans=(double)ans;
    }
    ans*=1000;
    printf("%d\n",(int)ans);
    return 0;
}

C++: //#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <math.h>
#include<algorithm>
#include <utility>
using namespace std;
int main() {
	double n, add, money = 100000;
	while (cin >> n) {
		add = 0;
		money = 100000;
		for (int i = 0; i < n; i++) {
			add = money*0.05;
			money += add;
		}
		int ans = money,t;
		cout << ans << endl;
		t=ans / 1000;
			ans /= 10000;
			ans *= 10000;
		if (t % 10 != 0) {
			ans += 10000;
		}
		cout << ans << endl;
	}
	return 0;
}

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

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

  int now = 100000;
  while(n--){
    now *= 1.05;
    if(now % 1000) now +=  -now % 1000 + 1000;
  }
  cout << now << endl;

  return 0;
}

C++: #include <cstdio>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);

    long long x=1e5;
    for (int i=0; i<n; ++i) {
        x += (x+19)/20;
        ((x+=999)/=1000) *= 1000;
    }

    printf("%lld\n", x);
    return 0;
}