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 := float64(100000)
		for i:=1; i<=n; i++ {
			debt = debt*1.05
			debt = math.Ceil(debt*0.001) * 1000
		}		
		fmt.Println(int(debt))
	}
}

C++: #include<iostream>

using namespace std;

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

C++: #include <stdio.h>

int main(void){
int n;
scanf("%d",&n);
int coin=100000;
for(int m=0;m<n;m++){
coin+=coin*0.05;
coin=(coin/1000)*1000+(coin%1000)>0? 1000:0;
}
printf("%d\n",coin);
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }


lint ceilll(lint a, lint b) {
  return (a + b - 1) / b;
}

int main() {
  cin.tie(nullptr); ios_base::sync_with_stdio(false);
  int n; cin >> n;
  lint a = 1e5;
  for (int _ = 0; _ < n; ++_) {
    a = ceilll(21 * a, 20 * 1000) * 1000;
  }
  cout << a << '\n';
}

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

int kiriage (int m) {
	if (m % 1000 == 0) return m;
	else {
		return (m / 1000 + 1) * 1000;
	}
}

int main() {
	int n;
	cin >> n;
	int money = 100000;
	for (int i = 0; i < n; i++) {
		money *= 1.05;
		money = kiriage(money);
	}
	cout << money << endl;
	return 0;
}

C++: /*
　　　　 ∧＿∧　にっぽんちゃちゃちゃ
　／＼（　・∀・）／ヽ
（ ●　と　　　つ　● ）　にっぽんちゃちゃちゃ
　＼/⊂、 ノ　　＼ノ
　　　　　し'
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807

signed main()
{
  string xyz ="";
int x=0,z=0,w=0,i=0,j=0,n=0;
std::cin >> x;
int y=100000;
rep(i,x){
  y*=1.05;
  y+=999;
  y/=1000;
  y*=1000;
}
std::cout << (int)y << '\n';
}

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

int main() {
	int loan = 100000;
	int hoge = loan * 0.05;
	int n;
	std::cin >> n;

	for (int i = 0; i < n; i++)
		loan += hoge;

	if (loan % 10000 < 5000)
		loan = loan / 10000 * 10000;
	else
		loan = loan / 10000 * 10000 + 10000;
	
	std::cout << loan << std::endl;
}

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

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

C++: #include <iostream>
#include <math.h>

using namespace std;

int debt = 100000;

int main() {
    int n;

    cin >> n;

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

    cout << debt << endl;

    return 0;
}

C++: #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define all(c) (c).begin(), (c).end()

using namespace std;
template<class T> inline void chmax(T& a, T b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, T b) { if(b < a) a = b; }

int main() {
	int N;
	double money = 100000;

	cin >> N;
	rep(i,N) {
		money = money * 1.05;
		money = (int) ceil(money/1000) * 1000;
	}
	cout << money << endl;
	
	return 0;
}

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

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

  cout << price << endl;
  }

C++: #include<iostream>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;

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

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

int main(){
    int debt = 100000;
    int week;
    
    cin >> week;
    
    for(int i = 0; i < week; ++i){
        debt *= 1.05;
        if(debt % 1000 != 0){
            debt = (debt + 999) / 1000;
            debt = debt * 1000;       
        }
    }

    cout << debt << endl;

    return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


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

C++: #include<bits/stdc++.h>

using namespace std;

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

    return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: #include <iostream>
#include <math.h>

using namespace std;

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

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

int main()
{
    int n;
    int ans=100000;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        ans*=1.05;
        if((ans%1000)!=0)
            ans-ans-ans%1000+1000;
    }
    cout<<ans<<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++: #include<iostream>

using namespace std;

int main(void){
	int money = 100000;
	int n;
	cin>>n;
	for(int i = 0; i < n ; i++){
	money = money + ((int)(money * 0.05)+999)/1000*1000;
	}
	cout<<money<<endl; 
}

C++: #include<iostream>
#include<math.h>

using namespace std;

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

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

    cout << debt << endl;
}