Go: package main

import (
        "fmt"
        "math"
)

func main() {
        var m int
        fmt.Scanf("%d", &m)
        debt := 100.0
        for i := m; i > 0; i-- {
                debt = math.Ceil(debt*1.05)
        }
        fmt.Printf("%d\n", int(debt*1000))
}

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;
	LL money = 100000;
	REP(i,n){
		money += money*5/100;
		REP(i,3){
			if(money % (int)pow(10,i+1) != 0){
				money /= 1000;
				money *= 1000;
				money += 1000;
				break;
			}
		}
	}
	cout << money << endl;
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

int gcd( int, int );

int main()
{
	unsigned int moto = 100000;
	int n;

	scanf("%d", &n );

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

	printf("%d\n", moto );

	return 0;
}

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

int main() {
	int n, i;
	double a = 100000;
	cin >> n;
	for (i = 0; i<n; i++) {
		a *= 1.05;
		ceil(a);
		while ((int)a % 1000 != 0) {
			a += 1;
		}
	}
	cout << (int)a << endl;
}

C++: #include<iostream>
using namespace std;
int main(){

	int n;
	int loan;

	cin >> n;
	loan;

	loan = 100000;

	for(int i=0; i<n; i++){
		loan = loan+loan*0.05;
		loan = loan+999;
		loan = loan/1000*1000;
	}

	cout << loan << endl;
	
	return 0;
}

C++: #include<cstdio>

int main() {
	int n, debt;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		debt = debt + debt*0.05;
	}
	printf("%d\n", debt);

	return 0;
}

C++: #include<iostream>

using namespace std;

int main() { 
    int weeks; 

    while( cin >> weeks ) {

	int sum = 100000;
	
    for(int i=0;i<weeks;i++){
    	
    sum *= 1.05;
    if( sum % 1000 !=0 )
    sum = ( sum / 1000 +1 ) * 1000;
    
	}
    cout << sum << "\n";
	}
    return 0; 
}

C++: 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>

using namespace std;


bool solve(){
	
	long a = 100000;
	int n;
	cin>> n;
	for(int i=0;i<n;i++){
		a = a*1.05;
		if(a%1000){
			a -= a%1000;
			a += 1000;
		}
	}
	cout<< a;
	cout<< endl;
	
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}

C++: #include <stdio.h>




int main(){

  int b=100000,n;
  scanf("%d",&n);
 
  for(int i = 0;i<n;i++){
    b*=1.05;
    if(b%1000!=0)b=(b/1000+1)*1000;
  }

  printf("%d\n",b);

  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i, a, cont, next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i, a, b, step) repfn(i, a, i < b, i + step)
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int rndup1000(int x) {
  int mod = x % 1000;
  if (mod)
    return x - mod + 1000;
  else
    return x;
}

int main(int argc, char **argv)
{
  int n;
  int debt = 100000;
  cin >> n;
  while (n--) {
    debt = rndup1000((debt/100)*105);
  }
  cout << debt << endl;
  return 0;
}

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

using namespace std;

int main(int argc, char const* argv[])
{
  int weeks;
  cin >> weeks;

  int debt = 100;
  for (int i = 0; i < weeks; i++) {
    debt = ceil(debt * 1.05);
  }

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <stack>
#include <set>
#include <cstdio>
#include <bitset>
#include <functional>
#include <tuple>
#include <list>
#include <deque>
using namespace std;
typedef pair<int, int> P;

#define FOR(i, a, n) for (ll i = (ll)a; i<(ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)

typedef long long ll;
typedef vector<int> VI;

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

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

int main() {
	int n;cin>>n;
	int a=100;
	for(int i=0;i<n;i++)
	{
		a=(int)ceil(a*1.05);
	}
	cout<<a*1000<<endl;
	return 0;
}

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

double round(double src, int n){
	double dst;
	dst = src*pow(10, -n-1);
	dst = (double)(int)(dst+0.9);
	return dst*pow(10, n+1);
}

int main(){
	double a=100000;
	int n, r;
	cin >> n;
	for (int i=0; i<n; i++){
	a=round(a*1.05, 2);
	cout << a << endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;

long int money = 100000;
int s = 100000;
int a[124],b[124];

int main(){
	int n;
	int tmp;
	cin>>n;
	//while(n!=0){
		money = 100000;
	for(int i=0;i<n;i++){
		money*=1.05;
		//if(i==n-1) cout << "\nbefore  \n" << money <<"\nafter"<<endl;
		
		money += money % 1000 != 0? 1000:0;
		money-=money%1000;
		b[i+1] = money;
		//if(i==n-1)	cout << money << endl;
	}
		cout<<b[n]<<endl;
		
		
 
    
    //scanf("%d",&n);
 
 
    for(int i=0;i<n;i++){
        if(int(s*1.05)%1000==0){
            s=int(s*1.05);
        }else{
            s= int(s*1.05) + (1000- int(s*1.05) % 1000);
        }
    	a[i+1] = s;
    }
    //printf("%d\n",s);
	
		for(int i=0;i<n;i++)
		if(a[i+1]!=b[i+1]){
		}
			//cout<<i+1<<" a = "<<a[i+1]<<" b = "<<b[i+1]<<endl;
	//cout << money << endl;
		//cin >> n;
	//}
	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
#define L(_i,_N) for(int _i=0;_i<_N;_i++)
#define C(_Dis) cout<<_Dis<<endl;

using namespace std;

typedef long long int lli;

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

C++: #include <stdio.h>
int main(void){
    int n,m=100000;
    scanf("%d",&n);
    while(n--)m+=m*.05,m+=(m%1000?1000-m%1000:0);
    printf("%d\n",m);
    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;
 cin >> n;
 int ans = 100000;;
 rep(i,n){
  int x = ans/20;
  ans += x;
  if(ans%1000) ans += (1000-(ans%1000));
 }
 cout << ans << endl;
 return 0;
}

C++: #include <iostream>

using namespace std;

void solve()
{
	int N;
	cin >> N;
	int sum = 100000;
	for(int i = 0; i < N; ++i)
	{
		sum *= 1.05;
		if(sum % 1000 != 0)
		{
			sum += 1000 - (sum % 1000); 
		}
	}
	cout << sum << endl;
}

int main()
{
	solve();
	return(0);
}