Go: package main

import "fmt"

var (
	dept    int = 100000
	addDept int = dept / 100 * 5
)

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

	nWeekDept := dept + addDept*week

	if nWeekDept/addDept%2 != 0 {
		nWeekDept += addDept
	}
	fmt.Print(nWeekDept)
}

C++: #include <iostream>

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

	return 0;
}

C++: #include <iostream>
#include <math.h>
using namespace std;
int main(void){
   int a;
   float b = 100000.0f;
   std::cin >> a;
   for(int i = 0; i < a; i++){
       b *= 1.05f;
       b /= 1000;
       double c = ceil(b);
       b = c * 1000;
   }
   std::cout << b << std::endl;
}

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

int main()
{
	int n;
	double debt;
	while (std::cin >> n)
	{
		debt = 100000;
		for (int i = 0; i < n; ++i)
		{
			debt += debt / 20;
			debt /= 1000;
			debt = std::ceil(debt);
			debt *= 1000;
		}
		std::cout << static_cast<long>(debt) << std::endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main() {
  int n;
  cin >> n;
  long c = 100000;
  for (int i = n; i > 0; i--) {
    c = ceil(c * 1.05 / 1000) * 1000;
  }
  cout << c << endl;
}

C++: #include <iostream>

int main(){
	int n,debt=100000;
	std::cin>>n;
	for(int i=0;i<n;i++) debt*=1.05;
	std::cout<<(debt%1000 ? debt/1000*1000+1000 : debt)<<'\n';
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int n, S = 100000;
	cin >> n;
	for (int i = 0; i < n; i++){
		S = S + S*0.05;
		S = (S / 1000) * 100;
	}
	cout << S << endl;
	return 0;
}

C++: #include<stdio.h>

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

  return 0;
}

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

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

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

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

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
static const double EPS = 1e-10;

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

	cin >> n;

	for(int i = 0; i < n; i++){
		debt += debt/20;
		if((debt % 1000) != 0){
			debt += 1000;
		}
		debt = debt/1000*1000;
	}

	cout << debt;

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,ten=100000;
  cin>>n;
  for(int i=1;i<=n;i++){
    ten+=ten/20;
  }
  cout<<ten/10000*10000+10000<<endl;
}

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

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

  while(n-- > 0) {
    debt += debt*0.05;
    if(debt%1000 != 0)
      debt += 1000 - debt%1000;
  }

  cout << debt << endl;

  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
double n,p=100000;
cin >> n;
for(;n;n--){
	p*=1.05;
}
p=p/10000+0.5;
cout << (int)p*10000 << endl;
return 0;
}

C++: #include <iostream>

#define DEBT 100000

using namespace std;

int main() {
	int		n;
	double	tmp;
	int		debt = DEBT;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		debt *= 1.05;
		tmp = debt / 1000.0;
		if ((debt > (int)tmp * 1000)) {
			debt = (int)tmp * 1000 + 1000;
		}
		else {
			debt = (int)tmp * 1000;
		}
	}
	cout << debt << endl;
}

C++: #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(int& a){printf("%d",a);}
//void print(long long& a){printf("%lld",a);}
void print(double& a){printf("%.15lf",a);}
template<class T> void print(T& a){cout<<a;}
template<class T> void print(vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(Head& head, Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(T& a){cerr<<a;}
template<class T> void dprint(vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(Head& head, Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}

int main(){
    int n;
    in(n);
    ll ans=100000;
    rep(i,n){
        ans=ans*1.05;
        if(ans%1000!=0)ans+=1000-ans%1000;
    }
    out(ans);
}

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

using namespace std;

int main(int argc, char const* argv[])
{
  int weeks;
  cin >> weeks;

  int debt = 100;
  for (int i = 0; i < weeks; i++) {
    debt = ceil(debt * 1.05);
  }

  cout << debt * 1000;
  return 0;
}

C++: #include<iostream>
int main(){int n,s=100000,i;std::cin>>n;for(i=0;i<n;i++)s*=1.05,s+=(1000-(s%1000==0?1000:s%1000));std::cout<<s;}

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

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

  for (int i = 1; i <= n; i++){
    debt *= 105;
    debt /= 100;
    if (debt % 1000 > 0){
      debt /= 1000;
      debt++;
      debt *= 1000;
    }
  }
  cout << debt << "\n";

  return 0;
}

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

int main() {
	int n;
	long debt = 100000;
	
	cin >> n;
	for (int i = 0;i < n;i++) {
		debt = ceil(debt * 1.05 / 1000) * 1000;
	}
	cout << debt << endl;

	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n;
	double debt = 10;
	
	cin >> n;
	
	for(int i = 0;i < n; i++){
		debt *= 1.05;
	}
	
	int d = debt;
	d++;
	cout << d*10000 << endl;
}

C++: #include <iostream>

int main(){
	int n,debt=100000;
	for(int i=0,std::cin>>n;i<n;i++) debt*=1.05;
	std::cout<<(debt%1000 ? debt/1000*1000+1000 : debt)<<'\n';
	return 0;
}

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

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
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;


const int Max=10000000;
bool prime[Max];
int main(void){
  int n, sum=100000;

  for(int i=0; i<n; i++){
    sum *= 1.05;
    sum = (sum/1000+1)*1000; 
  }
  cout << sum << endl;
}