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 <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int roan[105];

int main()
{
//	cut here before submit 
//	freopen ("testcase.DH", "r", stdin );
	memset (roan, 0, sizeof (roan ) );
	int n;
	scanf ("%d", &n );
	roan[0] = 100000;

	for (int i = 1; i <= 100; i++ ){
		double curr = (double)roan[i-1];
		curr *= 1.05;
		curr /= 1000.;
//		cout << "curr: " << curr << endl;
		curr = ceil (curr );
//		cout << "curr: " << curr << endl;
		curr *= 1000.;
		roan[i] = 	curr;
	} // end for
	cout << roan[n] << endl;
/*
	rep (i, 101 ){
		cout << roan[i] << endl;
	} // end rep
*/
//	printf ("%d\n", res );
		
	return 0;
}

C++: #include<stdio.h>
int main(){
	int n;
	int sum=100000;
	scanf("%d",&n);
	while(n){
		sum*=1.05;
		if(sum%1000!=0)sum=(sum/1000+1)*1000;
		n--;}
	printf("%d\n",sum);
	return 0;}

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

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

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

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

	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)+900)/1000*1000;
	}
	cout<<money<<endl; 
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef vector<int> VI;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    const double rate  = 1.05;
    int debt = 100000;

    int n;
    cin >> n;
    
    REP(i, 0, n) {
        debt *= rate;
        debt = ceil(debt / 1000.0) * 1000;
    }
    
    cout << debt << endl;

    return 0;
}

C++: #include <cstdio>

int main(void)
{
	int n,hensai=100000;

	std::scanf("%d",&n);
	for (int i=0;i<n;++i){
		hensai = hensai*1.05;
		if (hensai%1000){
			hensai -= hensai%1000;
			hensai += 1000;
		}
	}

	std::printf("%d\n",hensai);
}

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

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

	cin>>n;
	for(int i=0;i<n;i++){
		money=money*1.05+0.99999;
		cout<<money<<endl;
	}
	cout<<money*1000<<endl;
}

C++: #include <cstdio>

int main(void) {
	int money = 100000;
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		money *= 1.05;
		if(money % 1000)
			money = money - (money % 1000) + 1000;
	}
	printf("%d\n", money);
	return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <vector>
using namespace std;

const double interest = 0.05;
const int roundYen = 1000;

int weeklyAdd(double debt) {
  debt = debt * (1 + interest);
  debt = ceil(debt / roundYen) * roundYen;
  // std::cout << debt << '\n';
  return debt;
}

int main(int argc, char const *argv[]) {
  // int week = 5;
  int week;
  std::cin >> week;
  double debt = 100000;

  for (size_t i = 0; i < week; i++) {
    debt = weeklyAdd(debt);
  }
  std::cout << debt << '\n';

  return 0;
}

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

int main()
{
	int bor_money = 100000, n;

	cin >> n;

	for (int i = 0; i < n; i++) {
		bor_money *= 1.05;

		if (0 < (bor_money % 1000)) {
			bor_money /= 1000;
			bor_money += 1;
			bor_money *= 1000;
		}
	}
	cout << bor_money << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

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

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

using namespace std;

int roundUp(int x, int index);

int main(void)
{
    int i;
    int n;
    double intrst;
    int debt;
    
    cin >> n;
    
    debt = 100000;
    intrst = 0.05;
    for (i = 0; i < n; i++) {
        debt *= 1.0 + intrst;
        debt = roundUp(debt, 4);
    }
    cout << debt << endl;
    
    return 0;
}

int roundUp(int x, int index)
{
    int exp10;
    
    exp10 = pow(10, index - 1);
    x += exp10 - exp10 / 10;
    x /= exp10;
    x *= exp10;
    
    return x;
}

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

int main() {
    int n;
    cin >> n;
    long long ans = 100000;
    for (int i = 0; i < n; i++) {
        ans *= 1.05;
        string s = to_string(ans);
        for (int j = s.size() - 1; j > s.size() - 4; j--) {
            if (s[j] == '0') continue;
            for (int k = j; k > s.size() - 4; k--) s[k] = '0';
            ans = stoi(s);
            ans += 1000;
            break;
        }
    }

    cout << ans << endl;
    return 0;
}

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

#define N 100000

using namespace std;

int main(void){

  long int debt = 0;

  int n;
  cin >> n;

  debt = pow(1.05,n) * N;

  debt = (debt / 10000 +1) * 10000;

  cout << debt << endl;


  return 0;
}

C++: #include<iostream>
using namespace std;
#define F(I,N) for(int I=0;I<N;I++)

int main(){
	int n;
	int p,q;
	while(cin>>n){
		p=100000;
		q=100;
		F(i,n){
			p+=p*5/100;
			q+=q*5/100;
			if(p>q*1000) q++;
			p=q*1000;
		}
		cout<<p<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main() {
  float sum;
  int n;
  while (cin >> n) {
    sum = 100000;
    for (int i = 0; i < n; i++) {
      sum *= 1.05;
      sum = ceil(sum / 1000) / 1000;
    }
    cout << sum << 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 <bits/stdc++.h>
//#include <iostream>
//#include <Windows.h>
using namespace std;

int main(){
int n;
double a=100;
cin>>n;
while(n--){
	a=ceil(a+a*5/100);
}
cout<<a*1000;
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<double, int>;

int main() {
    int n;
    cin >> n;
    int debt = 100000;
    while(n--) {
        debt = debt * 105 / 100;
        debt = (debt+999) / 1000 * 1000;
    }
    cout << debt << endl;
}