Go: package main

import "fmt"

func roundUp1000(dept float64) float64 { 
	iDept := int(dept)
	if iDept-(iDept/1000*1000) != 0 { 
		iDept = ((iDept / 1000) + 1) * 1000 
	}
	return float64(iDept)
}

func main() {
	var week int
	fmt.Scan(&week)

	dept := 100000.0
	for i := 0; i < week; i++ {

		dept *= 1.05
		dept = roundUp1000(dept)
	}

	fmt.Println(int(dept))
}

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;

  return 0;
}

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

int main()
{
	int n;
	while (cin >> n)
	{
		int money = 100000;
		while (n--)
		{
			money *= 1.05;
		}
		if (money % 10000 != 0)
		{
			money -= (money % 10000);
			money += 10000;
		}
		cout << money << endl;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n,i;
	double m=100.0;
	cin>>n;
	for(i=0;i<n;i++){
		m*=1.05;
		if(m-(int)m>0.0){
			m+=1.0;
			m=(int)m;
		}
	}
	cout<<m<<"000"<<endl;
	return 0;
}

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 << endl;
    return 0;
}

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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)

template<typename T>
void remove(vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}

typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

int main(void){
	int n;
	cin >> n;
	double general = 100000.0;
	rep(i, n){
		general *= 1.05;
		general/=1000;
		general = ceil(general);
		general*=1000;
	}
	int x = general;
	cout << x << endl;
	return 0;
}



int StrToInt(string s){
	stringstream ss;
	ss << s;
	int val;
	ss >> val;
	return val;
}
string IntToStr(int i){
	stringstream ss;
	ss << i;
	return ss.str();
}

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

int main() {
	int week;
	cin >> week;
	int debt = 100;
	while (week--)
	{
		debt = ((debt * 105) / 100) + ((debt % 20) > 0 ? 1 : 0);
	}
	cout << debt * 1000 << endl;

	return 0;
}

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

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

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

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

using namespace std;

main(){
	int n;
	cin >> n;
	int s=0;
	int a=100000;
	while (s<n){
		s++;
		a=a+a*0.05;
		a=((a+999)/1000)*1000;
	}
	printf("%d\n",a);
}

C++: #include <stdio.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    int n;
    scanf("%d", &n);
    int cur = 100000;
    rep (i, n) {
        cur += cur / 100 * 5;
        cur = (cur+999)/1000*1000;
    }
    printf("%d\n", cur);
    return 0;
}

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

int main()
{
	int n;
	int cost = 100000;
	bool check = false;

	cin >> n;
	for(int i=0;i<n;i++) {
		cost *= 1.05;
		if(cost % 1000 > 0)
			check = true;
		else
			check = false;
		cost /= 1000;
		cost *= 1000;
		if(check) {
			cost += 1000;
		}
		cout << cost << endl;
	}

	cout << cost << endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#define MAX 100
using namespace std;

int main(){
	int n;
	int total;
	
	cin >> n;
	
	total = 100000 + ((0.05 * 100000)*n);
	if(total % 10000 != 0){
		total = total - (total % 10000);
		total = total + 10000;
	}
	
	cout << total << endl;
	
	return 0;
}

C++: #include <stdio.h>

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

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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>
#include <fstream>
#include <complex>
#include <math.h>
#include <ctype.h>
using namespace std;
int n,debt=100000;

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

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

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

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

int main(){ 
    int n;  
    double cath=100000;

    cin>>n; 

    for(int i=1;i<=n;i++){
        cath+=cath*0.05;
        cath=ceil(cath*0.001);
        cath*=1000;
    }
    cout<<cath<<endl;

    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
//ranker
using namespace std;

using ll = long long;
using lli = ll int;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


int main()
{
  int n, sum=100000;
  int i, j, k;
  int tot, ans, num;
  
  cin >> n;
  for(i=0; i<n; i++){
    sum += sum*(i+1)*0.05;
    sum = (sum/1000+1)*1000;
  }
  cout << sum << endl
    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<sstream>
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define mae(v) max_element(v.begin(),v.end())
#define mie(v) min_element(v.begin(),v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
typedef long long ll;
////////////////////////////////////////////////////////////

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

	ll s = 100000;
	rep(i,0,n){
		s += double(s)*0.05;
		//cout << s << endl;
		if( s % 1000 ){
			s = s / 1000 * 1000 + 1000;
		}
		//cout << s << endl;
	}

	cout << s << endl;
	
	ret 0;
}