using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
class Solve{
    public Solve(){}
    StringBuilder sb;
    ReadData re;
    public static int Main(){
        new Solve().Run();
        return 0;
    }
    void Run(){
        sb = new StringBuilder();
        re = new ReadData();
        Calc();
        Console.Write(sb.ToString());
    }
    void Calc(){
        int N = re.i();
        int[] P = re.ia();
        long count = 0;
        bool[] B = new bool[N];
        Fact F = new Fact(N+1);
        for(int i=0;i<N;i++){
            if(P[i] != 0){
                B[P[i]-1] = true;
            }
        }
        long sum = 0;
        int unused = 0;
        for(int i=0;i<N;i++){
            if(!B[i]){
                sum += i;
                unused++;
            }
        }
        sum %= Define.mod;
        count += F.f[unused];
        for(int i=0;i<N;i++){
            if(P[i] == 0){
                count = (count + sum*F.f[unused-1]%Define.mod*F.f[N-1-i]) % Define.mod;
            }
            else{
                count = (count + (P[i]-1)*F.f[unused]%Define.mod*F.f[N-1-i]) % Define.mod;
            }
        }
        {
            BIT bit = new BIT(N);
            for(int i=0;i<N;i++){
                if(P[i] != 0){
                    count = (count + Define.mod - bit.Sum(P[i]-1)*F.f[unused]%Define.mod*F.f[N-1-i]%Define.mod) % Define.mod;
                    bit.Add(P[i]-1,1);
                }
            }
        }
        {
            int c = 0;
            for(int i=0;i<N;i++){
                if(P[i] == 0){
                    count = (count + Define.mod - c*F.f[unused]%Define.mod*F.rf[2]%Define.mod*F.f[N-1-i]%Define.mod) % Define.mod;
                    c++;
                }
            }
        }
        if(unused != 0){
            BIT bit = new BIT(N);
            for(int i=0;i<N;i++){
                if(!B[i]){
                    bit.Add(i,1);
                }
            }
            long d = 0;
            for(int i=0;i<N;i++){
                if(P[i] == 0){
                    count = (count + Define.mod - d*F.f[unused-1]%Define.mod*F.f[N-1-i]%Define.mod) % Define.mod;
                }
                else{
                    d = (d + unused - bit.Sum(P[i]-1)) % Define.mod;
                }
            }
        }
        if(unused != 0){
            BIT bit = new BIT(N);
            for(int i=0;i<N;i++){
                if(!B[i]){
                    bit.Add(i,1);
                }
            }
            int c = 0;
            for(int i=0;i<N;i++){
                if(P[i] == 0){
                    c++;
                }
                else{
                    count = (count + Define.mod - c*bit.Sum(P[i]-1)%Define.mod*F.f[unused-1]%Define.mod*F.f[N-1-i]%Define.mod) % Define.mod;
                }
            }
        }
        sb.Append(count+"\n");
    }
}
struct BIT{
    long[] A;
    public BIT(int N){
        A = new long[N+1];
    }
    public void Add(int v,long x){
        v++;
        while(v < A.Length){
            A[v] += x;
            v += v & (-v);
        }
    }
    public long Sum(int v){
        v++;
        long C = 0;
        while(v > 0){
            C += A[v];
            v -= v & (-v);
        }
        return C;
    }
}
class Fact{
    public long[] f;
    public long[] rf;
    public Fact(int N){
        f = new long[N+1];
        rf = new long[N+1];
        for(int i=0;i<N+1;i++){
            if(i == 0){
                f[i] = 1;
            }
            else{
                f[i] = (f[i-1]*i)%Define.mod;
            }
        }
        for(int i=N;i>=0;i--){
            if(i == N){
                rf[i] = pow(f[N],Define.mod-2);
            }
            else{
                rf[i] = rf[i+1]*(i+1)%Define.mod;
            }
        }
    }
    public long pow(long N,long K){
        if(K == 0){
            return 1;
        }
        else if(K % 2 == 0){
            long t = pow(N,K/2);
            return t*t%Define.mod;
        }
        else{
            return N*pow(N,K-1)%Define.mod;
        }
    }
    public long GetFact(int N){
        return f[N];
    }
    public long GetConv(int N,int R){
        return ((f[N]*rf[R])%Define.mod*rf[N-R])%Define.mod;
    }
}
class ReadData{
    string[] str;
    int counter;
    public ReadData(){
        counter = 0;
    }
    public string s(){
        if(counter == 0){
            str = Console.ReadLine().Split(' ');
            counter = str.Length;
        }
        counter--;
        return str[str.Length-counter-1];
    }
    public int i(){
        return int.Parse(s());
    }
    public long l(){
        return long.Parse(s());
    }
    public double d(){
        return double.Parse(s());
    }
    public int[] ia(int N){
        int[] ans = new int[N];
        for(int j=0;j<N;j++){
            ans[j] = i();
        }
        return ans;
    }
    public int[] ia(){
        str = Console.ReadLine().Split(' ');
        counter = 0;
        int[] ans = new int[str.Length];
        for(int j=0;j<str.Length;j++){
            ans[j] = int.Parse(str[j]);
        }
        return ans;
    }
    public long[] la(int N){
        long[] ans = new long[N];
        for(int j=0;j<N;j++){
            ans[j] = l();
        }
        return ans;
    }
    public long[] la(){
        str = Console.ReadLine().Split(' ');
        counter = 0;
        long[] ans = new long[str.Length];
        for(int j=0;j<str.Length;j++){
            ans[j] = long.Parse(str[j]);
        }
        return ans;
    }
    public double[] da(int N){
        double[] ans = new double[N];
        for(int j=0;j<N;j++){
            ans[j] = d();
        }
        return ans;
    }
    public double[] da(){
        str = Console.ReadLine().Split(' ');
        counter = 0;
        double[] ans = new double[str.Length];
        for(int j=0;j<str.Length;j++){
            ans[j] = double.Parse(str[j]);
        }
        return ans;
    }
    public List<int>[] g(int N,int[] f,int[] t){
        List<int>[] ans = new List<int>[N];
        for(int j=0;j<N;j++){
            ans[j] = new List<int>();
        }
        for(int j=0;j<f.Length;j++){
            ans[f[j]].Add(t[j]);
            ans[t[j]].Add(f[j]);
        }
        return ans;
    }
    public List<int>[] g(int N,int M){
        List<int>[] ans = new List<int>[N];
        for(int j=0;j<N;j++){
            ans[j] = new List<int>();
        }
        for(int j=0;j<M;j++){
            int f = i()-1;
            int t = i()-1;
            ans[f].Add(t);
            ans[t].Add(f);
        }
        return ans;
    }
    public List<int>[] g(){
        int N = i();
        int M = i();
        List<int>[] ans = new List<int>[N];
        for(int j=0;j<N;j++){
            ans[j] = new List<int>();
        }
        for(int j=0;j<M;j++){
            int f = i()-1;
            int t = i()-1;
            ans[f].Add(t);
            ans[t].Add(f);
        }
        return ans;
    }
}
public static class Define{
    public const long mod = 1000000007;
}
public static class Debug{
    public static void Print(double[,,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                for(int l=0;l<k.GetLength(2);l++){
                    Console.Write(k[i,j,l]+" ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
        }
    }
    public static void Print(double[,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                Console.Write(k[i,j]+" ");
            }
            Console.WriteLine();
        }
    }
    public static void Print(double[] k){
        for(int i=0;i<k.Length;i++){
            Console.WriteLine(k[i]);
        }
    }
    public static void Print(long[,,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                for(int l=0;l<k.GetLength(2);l++){
                    Console.Write(k[i,j,l]+" ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
        }
    }
    public static void Print(long[,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                Console.Write(k[i,j]+" ");
            }
            Console.WriteLine();
        }
    }
    public static void Print(long[] k){
        for(int i=0;i<k.Length;i++){
            Console.WriteLine(k[i]);
        }
    }
    public static void Print(int[,,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                for(int l=0;l<k.GetLength(2);l++){
                    Console.Write(k[i,j,l]+" ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
        }
    }
    public static void Print(int[,] k){
        for(int i=0;i<k.GetLength(0);i++){
            for(int j=0;j<k.GetLength(1);j++){
                Console.Write(k[i,j]+" ");
            }
            Console.WriteLine();
        }
    }
    public static void Print(int[] k){
        for(int i=0;i<k.Length;i++){
            Console.WriteLine(k[i]);
        }
    }
}


Measured memory_bytes: 65312