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*=1.05
		// tmp = Ceil(tmp, -4) なぜかうまくいかない
		tmp = Ceil(tmp, -3)
		// fmt.Printf("now tmp: %d\n", int(tmp))
	}
	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>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

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

	cin >> n;

	FOR(i, 1, n) {
		money *= 1.05;
		if (money % 1000 != 0) {
			money = money - (money % 1000);
			money += 1000;
		}
	}
	cout << money << endl;
	return 0;
}

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

int main(){
  int n;
  double m=100000;
  cin>>n;
  for(int i=0;i<n;i++){
    m+=m*0.05;
    if((int)m%1000){
      m=(int)m/1000*1000;
      m+=1000;
    }else m=(int)m/1000*1000;
  }
  cout<<m<<endl;
  
  return 0;
}

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

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

C++: #include <iostream>


using namespace std;

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

  cout << money<<endl;

  return 0;
}

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

C++: #include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <windows.h>

int main(void);
int kiriage(int num);


int main(){
	int n;					//n週
	int debut = 100000;		//借金
	std::cin >> n;

	for (int i = 0; i < n; i++)
	{
		debut *= 1.05;
		std::string str_debut = std::to_string(debut);
		if ((str_debut[str_debut.length() - 1] == '0') &&
			(str_debut[str_debut.length() - 2] == '0') &&
			(str_debut[str_debut.length() - 3] == '0')
			){
			;
		}
		else{
			debut = kiriage(debut);
		}
	}

	std::cout << debut << std::endl;

	//while (1);
	return 0;
}

//1000円未満を切り上げる関数
int kiriage(int num){
	num = num / 1000 * 1000 + 1000;
	
	return num;
}

C++: #include <bits/stdc++.h>
using namespace std;
int yen=100000;
int main()
{
    int a,b,i,j,p,q;
    cin>>a;
    for(i=1;i<=a;i++)
    {
        b=yen*5;
        b=b/100;

        p=b/1000;
        q=b%1000;
        if(q!=0)p++;

        yen=yen+(p*1000);
    }
    cout<<yen;
    return 0;


}

C++: //Debt Hell
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll debt(ll x, int n){
  if(n==0)return x;
  else{
    x*=1.05;
    if(x%1000!=0)return debt(x-x%1000+1000, n-1);
    else return debt(x, n-1);
  }
}

int main(){
  int n;
  scanf("%d", &n);
  printf("%lld\n", debt(100000, n));
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int a;
  int b=100000;
  cin>>a;
  for(int i=0;i<a;i++){
    b=b*1.05;
    int c=b;
    if(c%1000!=0){
      b=b/1000;
      b=b*1000;
      b=b+1000;
    }
  }
  cout<<b<<"\n";
}

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++: #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 = floor(a);
		a *= 1000;
	}
	cout << a << endl;
	
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main() {
	int a, b, c, n=100000,s;
	cin >> a;
	for (a; a > 0; a--) {
		n *= 1.05;
		if (n % 1000 != 0)n += 1000;
		n /= 1000;
		n *= 1000;
	}
		cout << n<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n,ans = 100000;
  cin >>n;
  while(n--){
    ans = (int)(ans*1.05);
    if(ans%1000){ans = (ans/1000+1)*1000;}
  }
  cout <<ans<<endl;
  return 0;
}

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

int main(void)
{
  int n;
  int m = 100000;
  double tmp = 0.0;

  cin >> n;
  for(int i=0;i<n;i++)
    {
      tmp = 0.0;

      m = m * 1.05;
      if(m % 1000 == 0)
	{
	  continue;
	}
      else
	{
	  tmp = (double)m / 1000.0;
	  tmp = ceil(tmp);
	  tmp *= 1000.0;
	  m = tmp;
	}
    }

  cout << m << endl;
}

C++: #include <stdio.h>


int main(void){
    long debt=1000; // *100yen
    int n;

    scanf("%d", &n);
    for (int i=0; i<n; i++){
        debt *= 1.05;
        if (debt % 10){
            debt += (10 - (debt % 10));
        } 
    }
    printf("%d000", debt);
    return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int n,i,s,z;
	z=100000;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		s+=(z*n)/100;
	}
	printf("%d",s);
	return 0;
}

C++: #pragma GCC optimize "O3"
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define REP_FROM(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define REP_REV(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define REP_FROMREV(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#ifndef LOCAL
#define cerr if (false) cerr
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

template <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
template <class T> T sq(T x) { return x * x; }
template <class T> T clamp(T a, T l, T r) { return min(max(a, l), r); } // [l, r]
const double EPS = 1e-10;
const double PI  = acos(-1.0);

const int debt = 100000;

int solve(int n) {
	n++;
	double interest = debt * n;
	interest /= 20;
	return (int)(debt + interest + EPS);
}

int main(int argc, char *argv[]) {
	// Something to do
	int n;
	while(cin >> n) {
		cout << solve(n) << endl;
	}
	return 0;
}