# include <bits/stdc++.h>

using namespace std;

# define INF        (~(1<<31))
# define INFLL      (~(1ll<<63))
# define pb         push_back
# define mp         make_pair
# define abs(a)     ((a)>0?(a):-(a))
# define min(a,b)    ((a)<(b)?(a):(b))
# define lalal      puts("*******");
# define s1(x)      scanf("%d",&x)
# define Rep(a,b,c) for(int a=(b);a<=(c);a++)
# define Per(a,b,c) for(int a=(b);a>=(c);a--)

typedef long long int LL ;
typedef unsigned long long int uLL ;

const int    N   = 1e5+7;
const int    MOD = 1e9+7;
const double eps = 1e-8;
const double Pi  = acos(-1.0);
const double E   = exp(1.0);

inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return x*f;
}
void fre(){
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
}
template<typename T>inline T _gcd(T a,T b){return (b==0)?a:_gcd(b,a%b);}
template<typename T>inline T _lcm(T a,T b){return        a/_gcd(a,b)*b;}
LL qmod(LL a,LL b,LL c){LL ret=1ll;while(b){if(b&1)ret=ret*a%c;b>>=1,a=a*a%c;}return ret;}
/***********************************************************************/
int trie[N*40][3],sum[N*40],val[N*40],to[N*40],cnt,weishu = 30-1;
LL ans,tot,ta,tt;

inline void insert(int x){
    int now = 0;
    for(int i=weishu,bt;i>=0;i--){
        bt = 1-(0==(x&(1<<i)));
        if(!trie[now][bt]) trie[now][bt]=++cnt;
        now = trie[now][bt];
        sum[now]++;
    }
    val[now]=x;
}

inline int query(int x,int pre){
    int now = 0;
    for(int i=weishu,bt;i>=0;i--){
        bt = 1-(0==(x&(1<<i)));
        if(!trie[now][bt]) bt = 1-bt;
        if(now == pre) bt = 1-bt;
        now = trie[now][bt];
    }
    return now;
}

void dfs2(int x,int &pre){
    if(trie[x][0]) dfs2(trie[x][0],pre);
    if(trie[x][1]) dfs2(trie[x][1],pre);

    if(!trie[x][0]&&!trie[x][1]){
        int now = query(val[x],pre);
        if( ta==(val[now]^val[x])){
            tt =(tt+1ll*sum[now]*sum[x]%MOD)%MOD;
//            printf("%d %d  ",sum[now],val[now]^val[x]);
//            printf("%lld %lld<--\n",ta,tt);
        }
        if( ta>(val[now]^val[x])){
            ta=(val[now]^val[x]);
            tt=(1ll*sum[now]*sum[x])%MOD;
//            printf("%d %d  ",sum[now],val[now]^val[x]);
//            printf("%lld %lld<--\n",ta,tt);
        }
//        printf("%d  %d\n",now,x);
    }
}

void dfs(int x){
    if(trie[x][0]) dfs(trie[x][0]);
    if(trie[x][1]) dfs(trie[x][1]);

    if(trie[x][0]&&trie[x][1]){
        ta = INF,tt=0;

        if(to[trie[x][1]]<to[trie[x][0]])
            dfs2(trie[x][1],x);
        else      dfs2(trie[x][0],x);
//        puts("--");
        ans+=ta;
        tot=tot*tt%MOD;

    }
    else if(!trie[x][0]&&!trie[x][1]&&sum[x]>1)
        tot=tot*qmod(1ll*sum[x],1ll*sum[x]-2,1ll*MOD)%MOD;
}

int dfs1(int x){
    if(!trie[x][0]&&!trie[x][1])
        return to[x]=1;
    if(trie[x][0]) to[x]+=dfs1(trie[x][0]);
    if(trie[x][1]) to[x]+=dfs1(trie[x][1]);
    return to[x];
}

int main(){

    int n;
    while(~scanf("%d",&n)){
//        memset(trie,0,sizeof(trie));
//        memset(sum,0,sizeof(sum));
        cnt = 0;
        ans = 0ll,tot=1ll;

        for(int i=1,x;i<=n;i++){
            x=read();
            insert(x);
        }

//        puts("No.:");for(int i=0;i<=cnt;i++)  printf("%2d ",i);puts("");
//        puts("tot:");for(int i=0;i<=cnt;i++)  printf("%2d ",sum[i]);puts("");
//        puts("val:");for(int i=0;i<=cnt;i++)  printf("%2d ",val[i]);puts("");
//        puts("lson");for(int i=0;i<=cnt;i++)  printf("%2d ",trie[i][0]);puts("");
//        puts("rson");for(int i=0;i<=cnt;i++)  printf("%2d ",trie[i][1]);puts("");
//
//        printf("%lld\n",qmod(sum[30],sum[30]-2,MOD));

        dfs1(0);
        dfs(0);
        printf("%lld\n%lld\n",ans,tot);
    }
    return 0;
}