Gardon bought many many chocolates from the A Chocolate Market (ACM). When he was on the way to meet Angel,he met Speakless by accident.
"Ah,so many delicious chocolates! I'll get half of them and a half!" Speakless said.
Gardon went on his way,but soon he met YZG1984 by accident....
"Ah,so many delicious chocolates! I'll get half of them and a half!" YZG1984 said.
Gardon went on his way,but soon he met Doramon by accident....
"Ah,so many delicious chocolates! I'll get half of them and a half!" Doramon said.
Gardon went on his way,but soon he met JGShining by accident....
"Ah,so many delicious chocolates! I'll get half of them and a half!" JGShining said.
.
.
.
After had had met N people,Gardon finally met Angel. He gave her half of the rest and a half,then Gardon have none for himself. Could you tell how many chocolates did he bought from ACM?

Input contains many test cases.
Each case have a integer N,represents the number of people Gardon met except Angel. N will never exceed 1000;

For every N inputed,tell how many chocolates Gardon had at first.

  
  

   
   2
  
  

   
   

    
    7
   
   

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
    int a[1100];
}s[1010];
int main()
{
    int i,j,t,n;
    s[0].a[0]=1;
    for(i=1;i<=1000;i++)
    {
        int r=0;
        for(j=0;j<1000;j++)
        {
            s[i].a[j]=s[i-1].a[j]*2+r;

            r=s[i].a[j]/10;

            s[i].a[j]%=10;

        }
        t=0;
        while(s[i].a[t]+1>9)
        {
            s[i].a[t]=0;
            t++;
        }
        s[i].a[t]+=1;
    }
    while(scanf("%d",&n)!=EOF)
    {
        for(i=999;i>=0,s[n].a[i]==0;i--);
        for(j=i;j>=0;j--)
            printf("%d",s[n].a[j]);
        printf("n");

    }
    return 0;
}