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++: #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;
}

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

int main()
{
	double d = 100000.0;
	int n;
	cin >> n;
	for(int i=0; i<n; i++){
		d *= 1.05;
		d /= 1000.0;
		d = ceil(d);
		d *= 1000;
	}
	cout << (int)d << '\n';
}

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

int main() {
        double n, debt=10, loan;
        cin>>n;
        for(int i=0; i<n; i++) {
                loan = debt*5/100;
                debt += loan;
        }
        cout << ceil(debt)*10000 << endl;
        return 0;
}

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


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

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ll ans = 100000,n,i;scanf("%lld",&n);
    for(i=0;i<n;i++){
        ans += ans/20;
        if(ans%1000) ans = ans/1000*1000+1000;
    }
    printf("%lld\n",ans);
}

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

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

	ans = 100000;
	for(int i=0; i<n; i++) {
		ans *= 1.05;
		if(ans%1000 != 0) ans = (ans/1000+1)*1000;
	}
	cout << ans << endl;
	return 0;
}

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

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int n,ans=100000;

int main(){
    cin>>n;
    rep(i,n){
        ans*=1.05;
        ans=(ans+999)/1000*1000;
    }
    out(ans);
}

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

int age(int t) {
	return ceil((double) t / 10000) * 10000;
}

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

	int loan = 100000;
	loan += loan * 0.05 * n;

	std::cout << age(loan) << std::endl;
}

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

using namespace std;

int main(){
  int remaind = 100;  
  int n;
  
  cin >> n;

  for(int i = 0; i < n; i++){
    remaind = (int)ceil(remaind * 1.05);
  }

  cout << remaind * 1000 << endl;
  
  return 0;
}

C++: #include <iostream>

#define DEBT 100000

using namespace std;

int main(){
    int t, dbt=DEBT, frac;
    cin >> t;
    while(t--){
        dbt*=1.05;
        if(frac=dbt%1000){
            dbt+=1000-frac;
        }
    }
    cout << dbt << endl;
}

C++: //include
//------------------------------------------
#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>

using namespace std;

//conversion
//------------------------------------------
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();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

//container util
//------------------------------------------
#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())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  int n;
  double money = 100000, rate = 0.05, interest;

  cin >> n;

  REP(i, n) {
    interest = money * rate;
    money += interest;
    money = (int)money / 1000;
    money *= 1000;
    if((int)interest % 1000 > 0) money += 1000;
  }
  cout << (int)money << endl;
}

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

int main() {
  int n;
  cin >> n;
  int ans = 100000;
  for (int i=0;i<n;i++) {
    int a = 0.05*ans;
    if (a%1000)
      a = (a / 1000 +1) * 1000;
    ans += a;
  }
  cout << ans;
}