using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var p = ni(n);
        var mod = ModInt.SetModValue(1000000000 + 7);
        var unknownNum = 0;
        for (int i = 0; i < n; i++) {
            if (p[i] != -1) {
                p[i]--;
            } else {
                unknownNum++;
            }
        }
        var D = new DisjointSet(n);
        long added = 0;
        for (int i = 0; i < n; i++) {
            if (p[i] == -1) continue;
            if (D.Unite(i, p[i])) {
                added++;
            }
        }
        ModInt ans = 0;

        ans += added * ModInt.Pow(n - 1, unknownNum);

        var group = E.Range(0, n)
            .GroupBy(i => D.Root(i))
            .Select((g, index) => new { Index = index, Count = g.LongCount(), HasUnknown = g.Any(i => p[i] == -1) })
            .ToArray();

        //group.Dump();

        var otherPattern = unknownNum == 0 ? 0 : ModInt.Pow(n - 1, unknownNum - 1);

        foreach (var g in group) {
            if (!g.HasUnknown) continue;
            ModInt sub = 0;
            foreach (var g2 in group) {
                if (g.Index == g2.Index) continue;
                if (g2.HasUnknown) {
                    sub += otherPattern * g2.Count;
                } else {
                    sub += otherPattern * g2.Count; // +1
                }
            }
            ans += sub;
        }

        var u = group.Where(g => g.HasUnknown)
            .Select(g => g.Count)
            .ToArray();

        //u.Dump();

        var memo = new ModInt?[5002, 5002];

        ModInt dfs(int pos, int k) {
            if (pos == u.Length) {
                return (k == 0) ? 1 : 0;
            } else {
                var rem = u.Length - pos;
                if (k - rem > 0) return 0;
                if (k == 0) return 1;
                ref var ret = ref memo[pos, k];
                if (!ret.HasValue) {
                    ModInt val = 0;
                    val += dfs(pos + 1, k);
                    val += dfs(pos + 1, k - 1) * u[pos];
                    ret = val;
                }
                return ret.Value;
            }
        }

        var fact = new ModInt[5002];
        fact[0] = 1;
        for (int i = 1; i < fact.Length; i++) {
            fact[i] = fact[i - 1] * i;
        }

        for (int i = 2; i <= u.Length; i++) {
            var value = dfs(0, i);
            //new { i, value }.ToString().Dump();
            ans -= fact[i - 1] * value * ModInt.Pow(n - 1, unknownNum - i);
        }

        cout.WriteLine(ans);
    }
}

public class DisjointSet {
    private readonly long[] group;
    public int GroupCount { get; private set; }
    public DisjointSet(int n, int[] size = null) {
        group = new long[n];
        Clear(size);
        GroupCount = n;
    }
    public bool Unite(int x, int y) {
        x = Root(x); y = Root(y);
        if (x == y) {
            return false;
        }

        if (group[y] < group[x]) {
            return Unite(y, x);
        }

        group[x] += group[y];
        group[y] = x;
        GroupCount--;
        return true;
    }
    public bool IsSameSet(int x, int y) { return Root(x) == Root(y); }
    public int Root(int x) { return group[x] < 0 ? x : (int)(group[x] = Root((int)group[x])); }
    public long Size(int x) { return -group[Root(x)]; }
    public void Clear(int[] size = null) {
        for (int i = 0; i < group.Length; i++) {
            group[i] = -(size == null ? 1 : size[i]);
        }
    }
};
public struct ModInt : IEquatable<ModInt> {
    private static int mod = 0;
    private long _value;

    public ModInt(long x) {
        _value = x;
        Normalize();
    }

    private static long RegularMod(long x, int mod) {
        if (x >= mod) {
            if (x < 2 * mod) {
                return x - mod;
            }

            return x % mod;
        }
        if (x >= 0) {
            return x;
        }

        x = mod - RegularMod(-x, mod);
        if (x == mod) {
            return 0;
        }

        return x;
    }

    public static int SetModValue(int m) {
        return mod = m;
    }

    private void Normalize() {
        _value = RegularMod(_value, mod);
    }

    public override string ToString() {
        return _value.ToString(CultureInfo.InvariantCulture);
    }

    public int ToInt() {
        return (int)_value;
    }

    public static bool operator ==(ModInt c1, ModInt c2) {
        return c1._value == c2._value;
    }

    public static bool operator !=(ModInt c1, ModInt c2) {
        return !(c1 == c2);
    }

    public static ModInt operator +(ModInt x, ModInt y) {
        return new ModInt(x._value + y._value);
    }
    public static ModInt operator -(ModInt x, ModInt y) {
        return new ModInt(x._value - y._value);
    }
    public static ModInt operator -(ModInt x) {
        return new ModInt(-x._value);
    }
    public static ModInt operator *(ModInt x, ModInt y) {
        return new ModInt(x._value * y._value);
    }
    public static ModInt operator /(ModInt x, ModInt y) {
        return new ModInt(x._value * Inverse(y._value, mod));
    }
    public static ModInt operator ++(ModInt x) {
        return x + 1;
    }
    public static ModInt operator --(ModInt x) {
        return x - 1;
    }
    public static ModInt Pow(ModInt x, long n) {
        ModInt r = 1;
        while (n > 0) {
            if ((n & 1) != 0) {
                r *= x;
            }

            x *= x;
            n >>= 1;
        }
        return r;
    }
    private static long ExtendedGcd(long a, long b, ref long x, ref long y) {
        if (b == 0) {
            x = 1; y = 0;
            return a;
        } else {
            var d = ExtendedGcd(b, a % b, ref y, ref x);
            y -= a / b * x;
            return d;
        }
    }

    private static long Inverse(long a, long mod) {
        long x = 0, y = 0;
        if (ExtendedGcd(a, mod, ref x, ref y) == 1) {
            return (x + mod) % mod;
        } else {
            throw new Exception("Invalid inverse " + a + " " + mod);
        }
    }

    public static implicit operator ModInt(long x) {
        return new ModInt(x);
    }

    public override bool Equals(object obj) {
        if (obj == null) {
            return false;
        }
        return _value.Equals(((ModInt)obj)._value);
    }

    public override int GetHashCode() {
        return _value.GetHashCode();
    }

    public bool Equals(ModInt other) {
        return _value.Equals(other._value);
    }
}

// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 243720