// Original C++ solution (slower):
#include <iostream>

#include <string>

#include <vector>

#include <set>

#include <algorithm>

#include <cctype>

#include <cmath>

#include <queue>

#include <map>

#include <numeric>

#include <unordered_map>

#include <iomanip>

#include <functional>



#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

#define repi(i,a,b) for(ll i=ll(a);i<ll(b);i++)

#define all(x) (x).begin(),(x).end()



template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }

template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }



typedef long long ll;



using namespace std;



template <class Abel>

class BIT

{

public:

  using F=function<Abel(Abel,Abel)>;

  F f;

  ll l;

  vector<Abel> bit;

  Abel m0;

  BIT(ll maxidx,F fu,Abel m0):f(fu),l(maxidx),m0(m0)

  {

    bit.assign(l,m0);

  }

  void update(ll idx,ll val)

  {

    while(idx<=l)

    {

      bit[idx]=f(bit[idx],val);

      idx+=idx & -idx;

    }

  }

  ll query(ll idx)

  {

    ll res=m0;

    while(idx>0)

    {

      res=f(bit[idx],res);

      idx-=idx& -idx;

    }

    return res;

  }

};

ll mod=1e9+7;

int main()

{

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll n;cin>>n;

  vector<ll> s(n);

  rep(i,n)cin>>s[i];

  s.erase(unique(all(s)),s.end());

  //rep(i,s.size())cout<<s[i];

  ll l=s.size();

  map<ll,vector<ll>> cidx;

  vector<ll>tv;

  rep(i,l)

  {

    if(cidx.count(s[i])==0)

    {

      cidx[s[i]]=tv;

    }

    cidx[s[i]].push_back(i);

  }

  BIT<ll>bt(200100,[](ll a,ll b){return (a+b)%mod;},0);



  rep(i,l)

  {

    //cout<<i<<" "<<s[i]<<" ";

    ll tsum=bt.query(i+1);



    //cout<<tsum<<endl;

    ll nidx=upper_bound(all(cidx[s[i]]),i)-cidx[s[i]].begin();

    if(nidx==cidx[s[i]].size())continue;

    bt.update(cidx[s[i]][nidx]+1,(tsum+1));

    //cout<<tsum<<endl;



  }

  cout<<(bt.query(200010)+1)%mod<<endl;







  return 0;



}


// Optimized solution to the same problem (faster):
#include <iostream>

#include <string>

#include <vector>

#include <set>

#include <algorithm>

#include <cctype>

#include <cmath>

#include <queue>

#include <map>

#include <numeric>

#include <unordered_map>

#include <iomanip>

#include <functional>



#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

#define repi(i,a,b) for(ll i=ll(a);i<ll(b);i++)

#define all(x) (x).begin(),(x).end()



template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }

template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }



typedef long long ll;



using namespace std;



template <class Abel>

class BIT

{

public:

  using F=function<Abel(Abel,Abel)>;

  F f;

  ll l;

  vector<Abel> bit;

  Abel m0;

  BIT(ll maxidx,F fu,Abel m0):f(fu),l(maxidx),m0(m0)

  {

    bit.assign(l,m0);

  }

  void update(ll idx,ll val)

  {

    while(idx<=l)

    {

      bit[idx]=f(bit[idx],val);

      idx+=idx & -idx;

    }

  }

  ll query(ll idx)

  {

    ll res=m0;

    while(idx>0)

    {

      res=f(bit[idx],res);

      idx-=idx& -idx;

    }

    return res;

  }

};

ll mod=1e9+7;

int main()

{

  ios::sync_with_stdio(false);

  cin.tie(0);

  ll n;cin>>n;

  vector<ll> s(n);

  rep(i,n)cin>>s[i];



  s.erase(unique(all(s)),s.end());



  ll l=s.size();

  map<ll,vector<ll>> cidx;

  vector<ll>tv;

  rep(i,l)

  {

    if(cidx.count(s[i])==0)

    {

      cidx[s[i]]=tv;

    }

    cidx[s[i]].push_back(i);

  }



  BIT<ll>bt(l+1,[](ll a,ll b){return (a+b)%mod;},0);

  rep(i,l)

  {

    auto nitr=upper_bound(all(cidx[s[i]]),i);

    if(nitr==cidx[s[i]].end())continue;

    bt.update(*nitr,bt.query(i)+1);

  }

  cout<<(bt.query(l)+1)%mod<<endl;







  return 0;



}


// Fastest known solution for this problem: