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
	}
	tmp = Ceil(tmp, -4)
	return tmp
}

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

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

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

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

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

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

using namespace std;

int main(int argc, char const* argv[])
{
	int n;

	cin >> n;

	double money = 100000;
	for( int i = 0;i < n;i++ ){
		money *= 1.05;
		money /= 1000;
		money = int( money + 0.9 );
		money *= 1000;
	}
	cout << setiosflags( ios::fixed );
	cout << setprecision(0);
	cout << money << endl;
	return 0;
}

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

int main() {
  int n;
  
  while(1) {
    int m = 100000;
    while(n--) {
      m = ceil(m*1.05/1000)*1000;
    }
    cout << m << endl;
  }
  return 0;
}

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

int main() {
	int n;
	double d = 100000;
	cin >> n;
	for (int i = 0; i < n; i++) {
		d *=  1.05 / 1000;
		if (d - floor(d) > 0.0001) {
			d = ceil(d) * 1000;
		}else d *= 1000;
	}
	cout << d <<endl;
		
	return 0;
}

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

int main() {
  int n, a = 100000;
  scanf("%d", &n);
  while (n--) {
    a += a * 5 / 100;
    a = (int)ceil(a / 1000.0) * 1000;
  }
  printf("%d\n", a);
}

C++: #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>

using namespace std;
 
int main(){
  int n;
  scanf("%d",&n);
  double base = 100000;
  for(int i=0;i<n;i++){
    base*=1.05;
    if((int)base %1000 !=0) {
      int tmp = (int)base / 1000;
      base = tmp*1000 + 1000;
    }
 
  }
  printf("%d\n",(int)base);
}

C++: #include <cstdio>
#include <cmath>
using namespace std;
int main(){
    int n;
    int sum = 100000, is;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        is = ((sum / 20) % 1000 == 0) ? sum / 20 : (sum/20+1000)/1000*1000;
        sum += is;
    }
    printf("%d\n", sum);
}

C++: #include<iostream>

using namespace std;

int main(void)
{
	int n,ans;
	cin>>n;
	ans=10*10000;
	for(int i=1;i<=n;i++){
		ans=ans*1.05;
		if(ans%1000!=0){
			ans=ans-(ans%1000)+1000;
		}
	}
	cout<<ans<<endl;
}

C++: #include<iostream>
#include<math.h>
using namespace std;
int main() {
    int n;
    double dbt;
    dbt = 100000;
    cin >> n;
    for (; n > 0; n--) {
        dbt = dbt * 1.05;
        dbt = dbt / 1000;
        dbt = ceil(dbt);
        dbt = dbt * 1000;
    }
    cout << dbt;
    return 0;
}

C++: #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
 
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

int main(){
    int n;
    ll m = 100000;
    scanf("%d",&n);

    REP(i,n){
        ll l = m * 5 / 100;
        m += l;
        m = (m + 999) / 1000 * 1000;
    }
    printf("%lld\n",m);
    return 0;
}

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

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

	for(int i=0;i<n;++i){
		e *= 1.05;
		x = e % 1000;

		if(x != 0){
			e += (1000-x);
		}
	}

	cout << e << endl;

	return 0;
}

C++: #include<stdio.h>

int fun(long long a,int n){
	a=a/20*21;
	if(a%1000!=0){
		a=a/1000*1000+1000;
	}
	n--;
	if(n==0){
		return a;
	}
	else{
		return fun(a,n);
	}
}

signed main(){
	int n;
	long long a;
	scanf("%d",&n);
	a=fun(100000,n);
	printf("%d",a);
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	bool bo=false;
	int n,a=100000;
	cin>>n;
	for(int i=0;i<n;i++){
		a*=1.05;
	}
	if(a%10000==0 && a%1000==0 && a%100==0 && a%10==0){
		bo=true;
	}
	a/=10000;
	if(bo==false){
		a=a+1;
	}
	cout<<a*10000<<endl;
	return 0;
}

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

int main()
{
	int n;
	double debt = 10;
	double risi = 0.05;

	cin >> n;
	for(int i = 0;i < n;i++)
		debt += debt * risi;
	debt = ceil(debt);
	debt = 10000;
	cout << debt;

	return 0;
}

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

int main()
{

    int n;
    cin>>n;
    cout<<100000+(5000*n+n*1000)<<endl;

    return 0;
}

C++: #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	int n;

	while(cin>>n)
	{
		int m=100000;

		rep(i,n)
		{
			m*=1.05;
			if(m%1000!=0)
			{
				m-=m%1000;
				m+=1000;
			}

		}
		cout<<m<<endl;

	}
	


	return 0;
}

C++: #include <map>
#include <string>
#include <iostream>
#include<vector>
#include <set>
#include<math.h>
#include<algorithm>

using namespace std;

int main()
{
	int n, amount=100;
	cin >> n;
	
	for (int i=0; i<n; i++)
	{
		amount = amount * 1.05 + 0.999;
	}
	
	cout << amount*1000 << endl;
}

C++: #include <iostream>

int main() {
  int debt = 100000;
  int weeks; std::cin >> weeks;
  for(int i=0; i<weeks; i++) {
    debt = debt*1.05;  
    debt = (debt+999)/1000*1000;
  }  
  std::cout << debt << std::endl; 
}

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

const static double	de_PI	= 3.14159265358979323846;
const static int	de_MOD	= 1000000007;
const static int	de_MAX	= 999999999;
const static int	de_MIN = -999999999;

int main(void) {

	//std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());

	int a = 0;
	std::cin >> a;

	double n = 100000;
	for (int i = 0; i < a; i++) {
		n = n*1.05;
		n = static_cast<int>((n / 1000) + 0.999);
		n = n * 1000;
	}

	std::cout << n << std::endl;
}

C++: #include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int main(){
	int n;
	int ss=100000;
	cin>>n;
	fu(0,n){
		ss=ss*1.05;
		if(ss%1000!=0) ss=ss/1000*1000+1000;
	}
	cout<<ss<<endl;
}

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

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

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