[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：POJ 3070\r\n\r\n我们知道斐波那契数列 $F_0=0,F_1=1,F_n=F_{n-1}+F_{n-2}$。\r\n\r\n求 $F_n\\bmod 10^4$。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"多组数据，每组数据一行，一个整数 $n$。\r\n\r\n输入以 $-1$ 结束。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"对于每组数据，输出 $F_n\\bmod 10^4$。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["0\n9\n999999999\n1000000000\n-1","0\n34\n626\n6875"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据，$0\\le n\\le 10^9$。","subType":"markdown"}]