Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		debt := 100000 * math.Pow(1.05, float64(n))
		fmt.Println(math.Ceil(debt*0.0001)*10000)
	}
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E &b) const { return cost < b.cost; }
	bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
signed main() {
	int n;
	while (cin >> n) {
		int a = 100000;
		for (int i = 0; i < n; i++) {
			a = a * 105 / 100;
			if (a % 1000 > 0) {
				a = (a - a % 1000) + 1000;
			}
		}
		cout << a << endl;
	}
}

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

int main() {
	double m = 100;
	int n;

	std::cin >> n;
	for (int i = 0; i < n; ++i) {
		m *= 1.05;
		m = std::ceil(m);
	}
	std::cout << std::fixed << std::setprecision(0) << m * 1000 << std::endl;
	return 0;
}

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

main(void){
    int money = 100000, num;
    
    scanf("%d", &num);
    
    for( ; num >= 0; num--){
        money += money * 0.05;
    }
    
    printf("%d\n", money);

    return 0;
}

C++: #include<iostream>
using namespace std;
int increase_debt(int debt,int n) {
	if(n==0) return debt;
	debt += debt*0.05;
	if(debt % 1000 != 0)
		debt += 1000 - debt % 1000;
	increase_debt(debt,n-1);
}
int main() {
	int n;
	cin >> n;
	cout << increase_debt(100000,n) << endl;
	return 0;
}

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

int main() {
	int weeks;
	cin >> weeks;
	double loan = 100000;
	for (int week = 0; week != weeks; ++week) {
		loan *= 1.05;
		if (int(loan) % 1000 != 0) 
			loan = (loan+1000)-int(loan+1000)%1000;
	}
	cout << loan << endl;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

int n;
double res = 100000;

int main()
{
  cin >> n;

  while(n--){
    res *= 1.05;
    res = 1000 * ceil(res / 1000);
  }

  cout << res << endl;

  return 0;
}

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

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

C++: #include<iostream>
#include<string>
#include<queue>
#include<stack>
using namespace std;
int main(){
	stack<int>st;
	bool bo=false;
	int n,a=10000;
	cin>>n;
	for(int i=0;i<n;i++){
		a+=a*0.05;
	}
	if(a%100==0 && a%10==0 && a%10==0){
		bo=true;
	}
	cout<<a<<endl;
	a/=1000;
	if(bo==true){
	}
	else if(bo==false){
		a=a+1;
	}
	cout<<a*1000<<endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
	int n,ans=100000;
	cin>>n;
	
	for(int i=0;i<n;i++){
		ans*=1.05;
		if(ans%1000!=0){
			ans=ans-(ans%1000);
			ans+=1000;
		}
	}
	cout<<ans<<endl;
    return 0;
}

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

long int kane(int k){
	long int shakkin = 100000;
	for(int i=0;i<k;i++){
		shakkin = shakkin*1.05;
	if(shakkin%1000!=0)
		shakkin += 1000-(shakkin%1000);
	}
	return shakkin;
}

int main() {
	int n;
	cin >> n;
	cout << kane(n) << endl;
	return 0;
}

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

int main(){
  
  double n,mon=100000;
  cin>>n;
  for(int i=0;i<n;i++){
    mon=mon*1.05;
    mon=(mon+999)-(int(mon+999)%1000);
  }
  cout<<mon<<endl;   
  return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
static const double EPS = 1e-10;

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

	cin >> n;

	for(int i = 0; i < n; i++){
		debt += debt/20;
		if((debt % 1000) != 0){
			debt += 1000;
		}
		debt = debt/1000*1000;
	}

	cout << debt <<endl;

	return 0;
}

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

C++: #include<iostream>

using namespace std;


main(){

  int n;
  double money=100000;
  int i;

  cin >> n;

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

    money*=1.05;
    money/=1000;
    money+=0.9;

    money=(int)money;
    money*=1000; 
    
    
    
  }



  cout << (int)money << endl;




  return 0;
}

C++: #include <iostream>

using namespace std;

static const int ROUND = 1000;

int weeks;
double loan = 100000;
int rishi = loan * 0.05;
int temp;

int main(){
  scanf("%d", &weeks);
  while (weeks != 0){
      loan = loan *1.05;
      loan = (int(loan/ROUND) +1) * ROUND;
      weeks--;
  }
 cout << loan << endl;
 return 0;   
}

C++: #include <iostream>


using namespace std;

int main(){
  int n;
  double money=100000;
  cin >> n;

  for(int i = 0;i<n;i++){
    money+=(money*0.05);
  }
 money= ((int)money/10000)*10000+10000;
  cout << money<<endl;
  return 0;
}

C++: #include <stdio.h>
int main(){
int n,ans=100000;
scanf("%d",&n);
for(int i=0;i<n;i++){
ans*=1.05;
ans-=ans%1000;
}
printf("%d\n",ans);
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#pragma warning(disable:4996)

int main()
{

	int Debt = 100000;
	int Weeks = 0;
	scanf("%d", &Weeks);

	for (int nCnt = 0; nCnt < Weeks; nCnt++)
	{
		Debt += Debt * 0.05f;
		if (Debt % 1000 > 0)
			Debt += 1000 - (Debt % 1000);
	}

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

	return 0;
}