Số Fibonancy

#include<iostream>
#define F0 1;
using namespace std;
int main()
{
    int N = 0;
    int Fn, Fn1, Fn2;
    Fn1 = Fn2 = F0;
    do
    {
        cout << "Hay nhap vao gia tri N: ";
        cin >> N;
    } while (N <= 1);
    cout << "Day Fibonancy la: " << endl;
    cout << Fn1 << endl;
    cout << Fn2 << endl;
    while (Fn1  +  Fn2 < N)
    {
        Fn = Fn1 + Fn2;
        cout << Fn<< endl;
        Fn1 = Fn2;
        Fn2 = Fn;
    }
    return 0;
}