IT1

/*#include<iostream>
using namespace std;
int main()
{
char a;
cin >> a;
if (a >= 'A'&&a <= 'z')
{
if (a >= 'A'&&a <= 'Z')
{
a = a + 32;
cout << a;
}
else cout << a;
}
else cout << "请输入英文字母"<<endl;
return 0;
}*/

/*#include<iostream>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B;
C = A + B;
cout << C << endl;
return 0;
}*/

/*#include<iostream>
using namespace std;
int main()
{
int i, n, m = 0;
cin >> n;
if (n > 0)
{
for (i = 1; i <= n; i++)m = i + m;
cout << m << endl;
}
else cout << "请输入正整数" << endl;
return 0;
}*/

/*
#include<iostream>
using namespace std;
int main()
{
for (int a = 0; a < 2; a++)
for (int b = 0; b < 2; b++)
for (int c = 0; c < 2; c++)
for (int d = 0; d < 2; d++)
for (int e = 0; e < 2; e++)
cout << a << b << c << d << e << endl;
return 0;
}*/

/*
#include<iostream>
using namespace std;
int main()
{
int hanshu(int m);
int n;
cin >> n;
cout << hanshu(n);
return 0;
}

int hanshu(int m)
{
int a;
if (m == 0)a = 0;
else if (m == 1)a = 1;
else a = hanshu(m - 1) + hanshu(m - 2);
return a;
}
*/

/*
#include<stdio.h>
int main()
{
int hanshu(int n);
int n;
scanf("%d",&n);
printf("%d\n", hanshu(n));
return 0;
}

int hanshu(int n)
{
int Fn;
if (n == 0)Fn = 0;
else if (n == 1)Fn = 1;
else Fn = hanshu(n - 1) + hanshu(n - 2);
return Fn;
}
*/

/*
#include<iostream>
using namespace std;
int main()
{
int n, *Fn;
cin >> n;
Fn = new int[n + 1];
Fn[0] = 0;
Fn[1] = 1;
for (int i = 2; i <= n; i++)
{
Fn[i] = Fn[i - 1] + Fn[i - 2];
if (i==n)cout << Fn[i]<<endl;
}
return 0;
}
*/

#include<iostream>
using namespace std;
int main()
{
int n, f1 = 0, f2 = 1, fn;
cin >> n;
for (int i = 0; i<n - 1; i++)
{
fn = f1 + f2;
if (i == n - 2)cout << fn % 10007;
f1 = f2; f2 = fn;
}
return 0;
}

泰姬陵中的三角形

兔兔那么可爱怎么可以吃兔兔

二进制数的排列组合

围棋少年 历经磨难

小明太笨啦快来帮帮他鸭