Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	dbt := 100000

	for i := 0; i < n; i++ {
		dbt = dbt * 105 / 100
		if dbt%1000 > 0 {
			dbt = dbt - (dbt % 1000) + 1000
		}
	}

	fmt.Println(dbt)
}

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;
}

C++: #include <iostream>

using namespace std;

int calcDebtByWeek(int);

int main(void){
	int n; cin >> n;
	cout << calcDebtByWeek(n);

	return 0;
}

int calcDebtByWeek(int n){
	int currentDebt = (int)1e5;

	while(n --){
		currentDebt = int(currentDebt * 1.05);

		if(currentDebt % 1000) {currentDebt /= 1000; currentDebt ++; currentDebt *= 1000; }
	}	
	return currentDebt;
}

C++: #include <iostream>

#include <math.h>

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

  std::cin >> n;

  int x = 100000;

  for (int i = 0; i < n; i ++)
    x = ceil(x * 1.05 / 1000) * 1000;
  
  std::cout << x << std::endl;
}

C++: #include <iostream>

using namespace std;
 

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

	int debt = 100000;
	for (int i = 0; i < n; ++i)
	{
		debt *= 1.05;
		if (debt % 1000 > 0) debt += 1000;
		debt /= 1000, debt *= 1000;
	}

	cout << debt << endl;

	return 0;
}

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

int main()
{
	ll n, res = 100000;
	cin >> n;
	while (n--) {
		res = (res + res / 20 + 999) / 1000 * 1000;
	}
	cout << res << endl;
	return 0;
}

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

int main(){

	int n;
	int sum = 100000;

	while(cin>>n){

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

			sum *= 105/100.0;

			if(sum%1000>100){
				sum /= 1000;
				sum *= 1000;
				sum += 1000;
			}
		}
                cout<<sum<<endl;
	}
	return 0;
}

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

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

    long loan = 100000;

    for (int i = n; i > 0; i--) {
        loan = ceil((loan * 1.05) / 1000.0) * 1000;
    }

    cout << loan;
}

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

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

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

int main() {
        double n, debt=10, loan;
        cin>>n;
        for(int i=0; i<n; i++) {
                loan = debt*5/100;
                debt += loan;
        }
        cout << ceil(debt)<<"0000" << endl;
        return 0;
}

C++: #include <cstdio>

using namespace std;

int main() {
   int n = 0;
   double N = 0;
   int M = 0;
   int L = 100;
   int c = 0;
  scanf("%d", &n);
  for (int i = 0;i < n; i++) {
   N = L;
   M = L;
   c = 0;
   N *= 1.05;
   N -= M;
  while (N > 1) {
   N -= 1;
   c += 1;
  }
  if ( N > 0) {
   L += 1;
   }
   L += c;

  }

 L *= 1000;
 printf("%d", L);
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(void){
     int first=100000;
     int n;
     cin >> n;
     for(int i=0;i<n;i++){
	  first = first*1.05;
	  if(first%1000!=0){
	       first = (first/1000+1)*1000;
	  }
     }
     cout << first << endl;
     
     return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
 
using namespace std;
 
int main()
{
  int n;
  int total=100000;
  cin>>n;
  while(n--)
  {
    total=(int)(total*1.05);
    if(total%1000==0) continue;
    else total=(total/1000+1)*1000;          
  }
  cout<<total<<endl;
  //while(1);      
  return 0;    
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;



int main()
{
	int sum = 100000;
	int tmp;
	int n;

	scanf("%d",& n);

	for (int i = 0; i < n; i++) {
		sum += sum / 20;
		tmp = sum;
		sum -= sum % 1000;
		if (tmp != sum) sum += 1000;
	}
	printf("%d\n", sum);

	return (0);
	
}

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

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

C++: #include<stdio.h>
#include<math.h>
int main(){
int a,i;
double b=100,d=0,c=0;
scanf("%d",&a);
for(i=0;i<a;i++){
b*=1.05;
b+=0.9999;
double c=floor(b);
b=c;
}
printf("%d\n",(int)b*1000);
}