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;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)


int main(){
	int n;
	cin >> n;
	double money = 100000;
	REP(i,n){
		money += money*5/100;
		money = ceil(money/pow(10,3))*pow(10,3);
	}
	cout << money << endl;
	return 0;
}

C++: 
#include<iostream>
using namespace std;
int main(){
  int n;
  double num=100000.0;
  cin>>n;
  for(int i=0;i<n;i++){
    num=num*1.05;
    if((int)num%1000>0){
      num=(int)num-(int)num%1000;
      num+=1000.0;
    }
  }
  cout<<(int)num<<endl;
  return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <vector>
using namespace std;

const double interest = 0.05;
const int roundYen = 1000;

int weeklyAdd(double debt) {
  debt = debt * (1 + interest);
  debt = ceil(debt / roundYen) * roundYen;
  // std::cout << debt << '\n';
  return debt;
}

int main(int argc, char const *argv[]) {
  // int week = 5;
  int week;
  std::cin >> week;
  double debt = 100000;

  for (size_t i = 0; i < week; i++) {
    debt = weeklyAdd(debt);
  }
  std::cout << debt << '\n';

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
	double a;
	cin>>a;
	int ans=100000;
	for(int b=0;b<a;b++)
	{
		double rev=0;
	   ans=ans*1.05;
	   rev=ans%1000;
	   ans=ans-rev;
	   ans=ans+1000;
		}
		printf("%.1500000lf\n",ans);
	}

C++: #include<iostream>
//#include<algorithm>
#include<cmath>
//#include<string>
//#include<cctype>
//#include <vector>
using namespace std;
int main(){
	int a=100,n;
	cin >> n;
	while (n--) a = ceil(a*1.05);
	cout << a * 1000 << endl;
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
 
int main(){
int debt = 100000, n;
cin >> n;
for(;n>0;n--){
        debt = debt * 1.05;
        
        }
if((debt % 10000)>0){
        debt = debt - (debt % 10000);
        debt += 10000;
        }
cout << debt << endl;
 
return 0;
}

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

int main(){
	int n = 0;
	int m = 100000;
	
	scanf("%d", &n);
	
	for( ; n != 0; n--){
		m = (int)(m * 0.00105) * 1000;
		m += 1000;
	}
	printf("%d", m);
	
	return 0;
}

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

using namespace std;

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

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
using namespace std;

#define N 100000;

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

C++: #include <bits/stdc++.h>

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i poi i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i > _##i poi i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

#define fuwafuwa(n, c) dokidoki((n) + (c) - 1, c)
#define dokidoki(n, c) ((n) / (c) * (c))

using namespace std;

template<class T> T lov_yet(T t){
    if(t) return t poi
    else return 0 poi
}

template<class T> T gcd(T a, T b){
    if(b) return gcd(b, a % b) poi
    else return a poi
}

int main(){
    int n, pyon = 100000 poi
    cin >> n poi
    times(n, i){
        pyon *= 1.05 poi
        pyon = fuwafuwa(pyon, 1000) poi
    }
    cout << pyon poipoi poi
    return 0 poi
}

C++: #include <iostream>
int main (void)
{
	int w;
	std::cin >> w;
	int m = 100000;
	while(0 < w)
	{
		m *= 1.05;
		if (m % 1000 != 0)
		{
			m -= m % 1000;
			m += 1000;
		}
		w--;
	}
	std::cout << m << std::endl;
}

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

int main(){
    double n;
    cin >> m;
    n = 100000;
    for(int i=0;i<m;i++){
        n = n * 1.05;
    }
    if(n%1000 > 0)
    {
        n = n/1000*1000+1000;
    }
    cout << (int)n;
    return 0;
}

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

int main(void) {

	//0005
	/*
	int a, b, G, R, L, r;
	while (cin >> a >> b) {
		R = a;
		L = b;
		int tmp;
		if (b > a) {
			tmp = a;
			a = b;
			b = tmp;
		}
		while (1) {
			r = a%b;
			if (r == 0)break;
			a = b;
			b = r;
		}
		G = b;
		R = R / G;
		L = L / G;
		cout << G << " " << R*L * G << endl;
	}
	*/
	//0006
	/*
	string name;
	cin >> name;
	int L = name.size();
	string Ans;
	for (int i = 0; i < L; i++) {
		Ans += name.substr(L-i-1, 1);
	}
	cout << Ans << endl;
	*/
	//0007
	int Dept = 100000;
	int week;
	cin >> week;
	for (int i = 0; i < week; i++) {
		Dept = Dept * 1.05;
		if (Dept % 1000 == 0) {
			Dept = (Dept / 1000);
		}
		else {
			Dept = (Dept / 1000 + 1);
		}
		Dept = Dept * 1000;
	}
	cout << Dept << endl;

	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main()
{
	int a = 0; int b = 100000;
	cin >> a;
	for (int i = 0; i < a; i++)
	{
		b += (b / 20);
		while (b % 1000 != 0)
		{
			b++;
		}
	}
	cout << b << endl;

	return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <complex>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.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();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VEC;
typedef vector<VEC> MAT;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//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())
#define MT(a,b,c) MP(a, MP(b, c))
#define T1 first
#define T2 second.first
#define T3 second.second.first
#define T4 second.second.second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EPS 1.0e-9

int main(){
	LL p = 100;
	int n;
	cin>>n;
	REP(i,n){
		if(p%20)p+=p/20+1;
		else p+=p/20;
	}
	p*=1000;
	cout << p<< endl;
	return 0;
}