main()
{
int i=1,m,j=1,n,k;
clrscr();
scanf("%d",&n);
for(m=1;m<=n-2;m++)
{
i=j;
j=k;
k=i+j;
}
printf("%d",k);
getch();
}

At last we have nth value of fibonacci in k.