Go: package main

import "fmt"

func roundUp1000(dept float64) float64 { 
	iDept := int(dept)
	if iDept-(iDept/1000*1000) != 0 { 
		iDept = ((iDept / 1000) + 1) * 1000 
	}
	return float64(iDept)
}

func main() {
	var week int
	fmt.Scan(&week)

	dept := 100000.0
	for i := 0; i < week; i++ {

		dept *= 1.05
		dept = roundUp1000(dept)
	}

	fmt.Println(int(dept))
}

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 <iostream>

using namespace std;

int main(){

	int n;
	cin >> n;
	int debt = 100000;
	for(int i = 0; i < n; i++){
		debt += debt/20;
		int lower = debt % 1000;
		debt -= lower;
		if(lower != 0)
			debt += 1000;
	}
	cout << debt << endl;
	return 0;
}

C++: #include<iostream>

using namespace std;

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

  int debt = 100;
  
  for ( int i = 0; i < n; i++ )
    {
      debt *= 1050;
      
      if ( debt % 1000 != 0 )
        debt = debt / 1000 + 1;
      else
        debt /= 1000;
    }
  cout << debt * 1000 << endl;
  
  return 0;
}

C++: #include<cstdio>
using namespace std;
int main(void)
{
	int n,risi,gou,i,x;
	scanf("%d",&n);
	x=100000;
	for(i=0;i<n;i++){
		x=x*1.05;
		if(x%1000!=0){
			x=x+1000-(x%1000);
		}
	}
	printf("%d\n",x);
	return 0;
}

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

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

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

C++: #include <iostream>
#include <cmath>
#include <cstdio>
#define DEFAULT 100000
using namespace std;

int main(void) {
    double tax = 0.05 * DEFAULT;
    double start = DEFAULT;
    int num;
    cin >> num;
    for(int r = 0; r <= num; r++) {
        start += tax;
    }
    
    //cout << start << endl;
    start /= 1000;
    //cout << start << endl;
    start = ceil(start);
    start *= 1000;
    
    cout << (int)start << endl;
    
    return(0);
}

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

C++: #include <math.h>
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <string>

#define YES "YES"
#define NO "NO"
#define space ' '

using namespace std;

void func();

int main(void)
{
	
	func();

	return 0;
}


void func()
{
	int n, debt;

	debt = 100000;

	cin >> n;
	while (n-- > 0)
	{
		debt = debt + debt*0.05;
		if (debt % 1000 > 0)
			debt += 1000 - debt % 1000;

		cout << debt << endl;
	}
}

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

using namespace std;

int n;
long debt = 100000;

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

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

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

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long


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

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

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

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

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

	printf("%ld\n",money);
	
	return 0;
}

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

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

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	CI n;
	return;
}


int main(void) {
	input();
	long long double money = 100000;
	
	for (int i = 0; i < n; i++) {
		money *= 1.05;
		if ((int)money % 1000 > 0) {
			money = money - ((int)(money) % 1000) + 1000 - (money - (double)(int)money);
		}
		
	}
	
	CO money E
	

	return 0;
}

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

int main(){
int n;
cin >> n;
int a;
a=100000;
int b;
b=0;
while(b<n){
a=a/20*21/1000*1000;
b=b+1;}
cout << a<<endl;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){

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

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include<map>
#include<algorithm>
#include<set>
#include<iomanip>
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1; i<=n;i++)
#define rrep(i,n) for(int i = n-1;i >=0;i--)
#define ALL(a) a.begin(),a.end()
#define PI  acos(-1)
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T & val) {
    std::fill((T*)array, (T*)(array + N), val);
}
typedef long long int ll;
typedef long double ld;
const int MOD = 1e9 + 7;
int dx[4] = { 0,0,1,-1 }, dy[4] = { 1,-1,0,0 }, sum = 0,h,w;
int main() {
    int n;ll m = 100000; cin >> n;
    rep(i, n) {
        m += m * 0.05;
        if (m % 1000 != 0) {
            m -= m % 1000;
            m += 1000;
        }
    }cout << m << endl;
}