Go: package main

import (
  "fmt"
)

func main() {
  var a int
  var b int
  b = 100000
  fmt.Scan(&a)
  for i:= 0; i<a; i++ {
    b *= 105
    b /= 100
    if (b%1000 != 0) {
      b -= b%1000
      b += 1000
    }
  }
  fmt.Println(b)
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;

long int money = 100000;
int s = 100000;
int a[124],b[124];

int main(){
	int n;
	int tmp;
	cin>>n;
	//while(n!=0){
		money = 100000;
	for(int i=0;i<n;i++){
		money*=1.05;
		//if(i==n-1) cout << "\nbefore  \n" << money <<"\nafter"<<endl;
		if(i==24){
			tmp = money/100;
			//cout<<tmp<<endl;
		}
		tmp = money%1000;
		if(tmp!=0){
			money/=1000;
			money++;
			money*=1000;
			
		}
		b[i+1] = money;
		//if(i==n-1)	cout << money << endl;
	}
		//cout<<b[n]<<endl;
		
		
 
    
    //scanf("%d",&n);
 
 
    for(int i=0;i<n;i++){
        if(int(s*1.05)%1000==0){
            s=int(s*1.05);
        }else{
            s= int(s*1.05) + (1000- int(s*1.05) % 1000);
        }
    	a[i+1] = s;
    }
    //printf("%d\n",s);
	
		for(int i=0;i<n;i++)
		if(a[i+1]!=b[i+1])
			cout<<i+1<<" a = "<<a[i+1]<<" b = "<<b[i+1]<<endl;
	//cout << money << endl;
		//cin >> n;
	//}
	return 0;
}

C++: #include<iostream>

using namedspace std;

int week(int money){
	money = money + money * 0.05;
	money = money + 1000 - ( money % 1000 );
	return money;
}

int main(void){
	int n;
	int money = 100000;
	cin >> n;
	for(int i = 0;i < n;i++){
		money = week(money);
	}
	
	return 0;
}

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

int main(){

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

  return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
	int n, tmp = 100000;
	cin >> n;
	for (int i = 0; i < n; i++) {
		tmp *= 1.05;
		if (tmp % 1000) {
			tmp -= tmp % 1000;
			tmp += 1000;
		}
	}
	cout << tmp << endl;
	return 0;
}

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

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long int ll;
typedef vector<long long int> vi;

int main(){
	ll n,m=100000;
	cin >> n;
	REP(i, n){
		m *= 105;
		m /= 100;
		if (m % 1000 != 0){
			m -= m % 1000;
			m += 1000;
		}
	}
	cout << m << "\n";
}

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

const float a=1.05;

using namespace std;



int main(void)
{
	int debt,week;
	scanf("%d",&week);
	debt=100000;
	for(int loop=1;loop<=week;loop++)
	{
		debt*=1.05;
		if(debt%1000!=0)
		{
			debt=debt-(debt%1000)+1000;
		}
	}
	printf("%d",debt);
	return 0; 
}

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

int main(){

	int money = 100000;
	int n;
	cin >> n;

	while (n--)
	{
		money *= 1.05;
		if (money % 1000 != 0)
		{
			money += 1000 - (money % 1000);
		}
	}
	cout << money << endl;

	return 0;
}

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

using namespace std;

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

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

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

C++: //--------------------------------------------------template----------------------------------------//
//c
#include <stdio.h>
#include <time.h>
#include <math.h>
//c++
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <complex>
#include <cmath>
//c++11
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.rbegin(),v.rend())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int n;

int main() {
	cin >> n;
	ll now = 100000;
	for (int i = 0; i < n; i++) {
		now = now + now*0.05;
		if (now % 1000 != 0) {
			now /= 1000;
			now++;
			now *= 1000;
		}
	}
	cout << now << 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 <iostream>

using namespace std;

int main() {

	int n, debt=100000;

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

	return 0;

}

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

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

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

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

long long int ans[110] ;

void init ( ) ;

int main ( )
{
	int N ;
	init ( ) ;
	while ( scanf ( "%d" , &N ) == 1 ) {
		printf ( "%lld\n" , ans[N] ) ;
	}
	return 0 ;
}

void init ( )
{
	ans[0] = 100000 ; 
	for ( int i = 1 ; i < 101 ; i++ ) {
		long long int tmp = ans[i-1] * 105 / 100 ;
		if ( tmp % 1000 > 0 ) {
			long long int s = tmp % 1000 ;
			tmp = tmp + 1000 - s ;
		}
		ans[i] = tmp ;
	}
}

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


int brack(int n){
	int x = 100000;
	int y = 0;
	for (int i = 0; i < n; i++){
		x *= 1.05;
		y = x % 1000;
		if (y != 0){
			x -= y;
			x += 1000;
		}
	}
	return x;
}


int main(){
	int n;
	cin >> n;
	cout << brack(n) << endl;

	return 0;
}