#include <iostream>
#include <vector>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
#include <stdexcept>
#include <type_traits>
#include <cctype>
#include <list>
#include <deque>
#include <stack>
#include <functional>
using namespace std;

//primjer 3, zadatak 4
// provjeriti sto neki divlji rez daje
int Fun(list<double> v){
    auto p=v.begin();
    auto q=v.begin();
    p++;
    while (p!=v.end()){
        while (p!=v.end() && *p!=*q) {
            cout<<*p<<" ";
            p++;
        }
        auto temp=p;
        if (p==v.end()) return 0;
        while (p!=v.end() && *p==*q){
            p++;
            q++;
        }
        if (p==v.end()) return distance(p, q);
        p=temp;
    }
    return 0;
}


int main()
{
    list<double>v={1, 2, 3, 1, 2, 3, 1, 2, 3};
    cout<<Fun(v);
    return 0;
}