#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
//#include <dos.h>
typedef int ElemType;
typedef struct Node
{
ElemType data;
struct Node *next;
}Node;
typedef struct Queue
{
Node * front;
Node * rear;
int length;
}Queue;
Queue * queue_new();
bool IsEmpty(Queue *q);
bool EnQueue(Queue *q, ElemType e);
bool DeQueue(Queue *q, ElemType *e);
void BlackBox(int n);
int main()
{
int n;
while (scanf("%d", &n) != EOF)
BlackBox(n);
//system("pause");
return 0;
}
/********************************************************
* 算法:队列中开始有两个'1',循环i=1 to n-1次{ *
* 循环j=1 to i次{ *
* 1.出队, *
* 2.得到的元素与队头元素相加再将结果入队 } *
* 3.入队'1'} *
********************************************************/