#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

inline char nc(){

    static char buf[],*p1=buf,*p2=buf;

    if(p1==p2){

        p2=(p1=buf)+fread(buf,,,stdin);

        if(p1==p2)return EOF;

    }

    return *p1++;

}

inline void read(int& x){

    char c=nc(),b=;

    for(;!(c>=''&&c<='');c=nc())if(c=='-')b=-;

    for(;c>=''&&c<='';x=x*+c-,c=nc());x*=b;

}

struct ask{

    int s,e,f;

}b[];

inline bool cmp(ask x,ask y){

    return x.s<y.s;

}

int ans[],i,j,k=,n,a[],last[],m,c[],x,y,next[];

inline int lowbit(int x){

    return x&(-x);

}

inline void update(int x){

    for(int i=x;i<=n;i+=lowbit(i))c[i]++;

}

inline int query(int x){

    int ans=;

    for(int i=x;i>;i-=lowbit(i))ans+=c[i];

    return ans;

}

int main()

{

    read(n);

    for(i=;i<=n;i++)read(a[i]);

    read(m);

    for(i=;i<=m;i++)read(b[i].s),read(b[i].e),b[i].f=i;

    sort(b+,b+m+,cmp);

    for(i=;i<=n;i++)

    if(!last[a[i]]){

        last[a[i]]=i;

        update(i);

    }else{

        next[last[a[i]]]=i;

        last[a[i]]=i;

    }

    for(i=;i<=m;i++){

        while(k<b[i].s){

            if(next[k])update(next[k]);

            k++;

        }

        ans[b[i].f]=query(b[i].e)-query(b[i].s-);

    }

    for(i=;i<=m;i++)printf("%d\n",ans[i]);

    return ;

}