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+=tmp*0.05
	}
	return Round(tmp, -4)
}

func Round(f float64, places int) float64{
	shift := math.Pow(10, float64(places))
	return math.Floor(f * shift+.5)/shift
}

func next()string{
	sc.Scan()
	return sc.Text()
}

func nextInt()int{
	a, _ := strconv.Atoi(next())
	return a
}

C++: #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(int& a){printf("%d",a);}
//void print(long long& a){printf("%lld",a);}
void print(double& a){printf("%.15lf",a);}
template<class T> void print(T& a){cout<<a;}
template<class T> void print(vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(Head& head, Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(T& a){cerr<<a;}
template<class T> void dprint(vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(Head& head, Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}

int main(){
    int n;
    in(n);
    ll ans=100000;
    rep(i,n){
        ans=ans*1.05;
        if(ans%1000!=0)ans+=1000-ans%1000;
    }
    out(ans);
}

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

C++: #include<iostream>
int main(){int n,s=100000,i;std::cin>>n;for(i=0;i<n;i++)s*=1.05,s+=(1000-(s%1000==0?1000:s%1000));std::cout<<s;}

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

int main(){
  int n, debt = 100000;
  cin >> n;

  for (int i = 1; i <= n; i++){
    debt *= 105;
    debt /= 100;
    if (debt % 1000 > 0){
      debt /= 1000;
      debt++;
      debt *= 1000;
    }
  }
  cout << debt << "\n";

  return 0;
}

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

int main() {
	int n;
	long debt = 100000;
	
	cin >> n;
	for (int i = 0;i < n;i++) {
		debt = ceil(debt * 1.05 / 1000) * 1000;
	}
	cout << debt << endl;

	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n;
	double debt = 10;
	
	cin >> n;
	
	for(int i = 0;i < n; i++){
		debt *= 1.05;
	}
	
	int d = debt;
	d++;
	cout << d*10000 << endl;
}

C++: #include <iostream>

int main(){
	int n,debt=100000;
	for(int i=0,std::cin>>n;i<n;i++) debt*=1.05;
	std::cout<<(debt%1000 ? debt/1000*1000+1000 : debt)<<'\n';
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


const int Max=10000000;
bool prime[Max];
int main(void){
  int n, sum=100000;

  for(int i=0; i<n; i++){
    sum *= 1.05;
    sum = (sum/1000+1)*1000; 
  }
  cout << sum << endl;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
typedef pair<int,int> pii;

inline bool IN(int x, int y, int w, int h)
{
    return 0 <= x && x < w && 0 <= y && y < h;
}


int main()
{
	int n;
	int ans=100000;
	cin >> n;
	rep(i,n){
		if((int)(ans*1.05+0.9)%1000==0){
			ans=ans*1.05;
		}else{
			ans = (int)(ans*1.05 / 1000 + 1)*1000;
		}
	}
	cout << ans << endl;
}

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

int main(){
  int n,ans=100000;
  cin>>n;
  while(n--){
    ans*=1.05;
    if(ans%1000>0){
      ans/=1000;
      ans*=1000;
      ans+=1000;
    }
  }
  cout<<ans<<endl;
}

C++: #include <stdio.h>

int main(void) {

  int n;

  int debt;
  
  int i;

  scanf("%d",&n);

  debt=100000;

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

    debt*=1.05;
    if(debt%1000!=0) debt+=1000-(debt%1000);
    //printf("%d\n",debt);
  }

  printf("%d\n",debt/1000*1000);

  return 0;

}

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

int main(){
	int n;
	double sum=100000;
	std::cin>>n;
	for(int i=0;i<n;i++){
		sum*=1.05;
		sum/=1000;
		sum=ceil(sum);
		sum*=1000;
	}
	std::cout<<sum<<std::endl;
	return 0;
}

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

int main()
{
    int n;
    cin >> n;
    int loan = 100000;
    for(int i=0; i<n; i++){
        loan = loan * 1.05;
    }

    loan = loan/1000;
    loan = loan * 1000;
    loan = loan + 1000;
    
    cout <<loan<<endl;
    
    return 0;
}

C++: #include<cstdio>
#include<iostream>
using namespace std;
int main()
{
	int i,j,n;
	long long m=100000,k,p;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		m=m+(m*5/100);
		if(m%1000!=0)
		{
			m=m/1000;
			m=m*1000+1000;
		}
	}
	cout<<m<<endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int debt, n;

	cin >> n;

	debt = 100000;

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

	cout << debt << endl;
	return (0);
}