#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int fibonacci(int n){
vector<int> s;
s.push_back(0);
s.push_back(1);
for (int i=2;i<n;i++){
s.push_back(s[i-1]+s[i-2]);
}
for(auto i=s.begin();i!=s.end();i++){
cout<<*i<<" ";
}
cout<<endl;
int max=(s.front());
return max;
}
int main() {
// your code goes here
int n=10;
int max=fibonacci(n);
cout<<max<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgZmlib25hY2NpKGludCBuKXsKCXZlY3RvcjxpbnQ+IHM7CglzLnB1c2hfYmFjaygwKTsKCXMucHVzaF9iYWNrKDEpOwoJZm9yIChpbnQgaT0yO2k8bjtpKyspewoJCXMucHVzaF9iYWNrKHNbaS0xXStzW2ktMl0pOwoJfQoJZm9yKGF1dG8gaT1zLmJlZ2luKCk7aSE9cy5lbmQoKTtpKyspewoJCWNvdXQ8PCppPDwiICI7Cgl9Cgljb3V0PDxlbmRsOwoJaW50IG1heD0ocy5mcm9udCgpKTsKCXJldHVybiBtYXg7Cn0KaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbj0xMDsKCWludCBtYXg9Zmlib25hY2NpKG4pOwoJY291dDw8bWF4PDxlbmRsOwoJCgkKCXJldHVybiAwOwp9