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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	CI n;
	return;
}


int main(void) {
	input();
	long long double money = 100000;
	
	for (int i = 0; i < n; i++) {
		money *= 1.05;
		if ((int)money % 1000 > 0) {
			money = money - ((int)(money) % 1000) + 1000 - (money - (double)(int)money);
		}
		
	}
	
	CO money E
	

	return 0;
}

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

int main(){
int n;
cin >> n;
int a;
a=100000;
int b;
b=0;
while(b<n){
a=a/20*21/1000*1000;
b=b+1;}
cout << a<<endl;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){

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

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include<map>
#include<algorithm>
#include<set>
#include<iomanip>
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1; i<=n;i++)
#define rrep(i,n) for(int i = n-1;i >=0;i--)
#define ALL(a) a.begin(),a.end()
#define PI  acos(-1)
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T & val) {
    std::fill((T*)array, (T*)(array + N), val);
}
typedef long long int ll;
typedef long double ld;
const int MOD = 1e9 + 7;
int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 }, sum = 0,h,w;
int main() {
    int n;ll m = 100000; cin >> n;
    rep(i, n) {
        m += m * 0.05;
        if (m % 1000 != 0) {
            m -= m % 1000;
            m += 1000;
        }
    }cout << m << endl;
}

C++: #include <stdio.h>

int main(){
    long int money = 100000;
    int n;
    scanf( "%d",&n );
    for( int i = 0;i < n;i++ ){
        money = ( float )money * 1.05;
        if( money % 1000 != 0 ) money += 1000-( money%1000 );
    }
    printf( "%d",money );
    return 0;
}

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

int main()
{
	int n;
	while (cin >> n)
	{
		while (n--)
		{
			money *= 1.05;
		}
		if (money % 10000 != 0)
		{
			money -= (money % 10000);
			money += 10000;
		}
		cout << money << endl;
	}

	return 0;
}

C++: /*
AizuOnline A0007
Debt Hell
*/
#include <stdio.h>
#include <float.h>
#include <math.h>

main()
{

  int i,weeks;
  float debt;

  debt = 100000.0;

  scanf("%ld",&weeks);
  
  for(i=0;i<weeks;i++)
    {       debt *=1.05;
            debt = 1000.0 * ceil(debt/1000.0);
    }

  printf("%ld\n",(long int)debt);

return(0);
}

C++: #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
	int n;
	cin >> n;
	double d = 100000;
	while (n--)
	{
		d += 5. / 100 * d;
		d = ceil(d / 1000) * 1000;
	}
	cout << fixed << setprecision(0) << d << endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

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

  cin >> i;

  int cutoff = 1000;

  double dif;
  for(; i > 0; i--){
    money += money*0.05;
    dif = ((int)money/cutoff)*cutoff;
    if(money - dif > 0){
      money = dif + cutoff;
    }
  }

  cout << money << endl;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char const* argv[])
{
	int n;

	cin >> n;

	int money = 100000;
	for( int i = 0;i < n;i++ ){
		money *= 1.05;
		int hoge = 1000 - money % 1000;
		money += ( hoge != 1000 ) ? hoge : 0;
	}
	cout << money << endl;
	return 0;
}

C++: #include<stdio.h>

int main(void){
	int QBs;
	int i,n;
	
	QBs = 100000;
	
	scanf("%d", &n);
	
	for(i = 0; i < n; i++){
		QBs = QBs *1.05;
		if(QBs % 1000 != 0){
			QBs = QBs - QBs%1000;
			QBs = QBs + 1000;
		}
	}
	printf("%d\n",QBs);
	return 0;
}

C++: #include<stdio.h>
#include<string.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);
	}
	printf("%d\n",a);
	return 0;
}

C++: #include<iostream>

double Kiriage(double a)
{
	a *= 10;

	int aI = a;

	if(a>aI)
	{
		aI += 1;
	}
	return 1.0*aI/10;
}

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

	int n;

	std::cin >> n;

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

		debt = Kiriage(debt);
	}

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

}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  int n;
  cin >> n;
  int x = 100000;
  rep(i, n) {
    x = (x * 105 / 100 + 5000) / 10000 * 10000;
  }
  cout << x << endl;
}

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

int main(){
	double n,i,tmp;
	double ans=100000;
	cin>>n;
	while(n--){
		ans *= 1.05;
		ans = ceil(ans/1000)*1000;

	}
	cout<<ans<<endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
  int n;
  int m=100000;
  cin>>n;
  rep(i,n){
    m*=1.05;
	if(m%1000)m+=1000;
	m-=m%1000;
  }
  cout<<m<<endl;
}