Program Menghitung Deret Fibonacci dengan Fungsi Rekursif

#include <iostream>
#include <conio.h>
using namespace std;

class Operator {
friend ostream& operator<<(ostream&, Operator&);
friend istream& operator>>(istream&, Operator&);
public:
long fibonacci(int);
private:
int n;
};

int fibonacci (int n)
{ if ((n == 1) || (n == 2)) return(1);
else return(fibonacci(n-1) + fibonacci(n-2));
}
ostream& operator<<(ostream& out, Operator& a) {
for (int i = 1; i <= a.n; i++)
out << fibonacci(i) << " ";
return out;
}
istream& operator>>(istream& in, Operator& a) {
cout << "Masukan banyak suku : ";
in >> a.n;
return in;
}

main() {
Operator run;
cin >> run;
cout << run;
getch();
}