#include <bits/stdc++.h>
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
  static char buf[IN_BUF], *ps = buf, *pt = buf;
  if (ps == pt) {
    ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
  }
  return ps == pt ? EOF : *ps++;
}
template <typename T>
inline bool read(T &x) {
  bool op = 0;
  char ch = IO::myGetchar();
  x = 0;
  for (; !isdigit(ch) && ch != EOF; ch = IO::myGetchar()) {
    op ^= (ch == '-');
  }
  if (ch == EOF) {
    return false;
  }
  for (; isdigit(ch); ch = IO::myGetchar()) {
    x = x * 10 + (ch ^ '0');
  }
  if (op) {
    x = -x;
  }
  return true;
}
inline int readStr(char *s) {
  int n = 0;
  char ch = IO::myGetchar();
  for (; isspace(ch) && ch != EOF; ch = IO::myGetchar())
    ;
  for (; !isspace(ch) && ch != EOF; ch = IO::myGetchar()) {
    s[n++] = ch;
  }
  s[n] = '\0';
  return n;
}
inline void myPutchar(char x) {
  static char pbuf[OUT_BUF], *pp = pbuf;
  struct _flusher {
    ~_flusher() { fwrite(pbuf, 1, pp - pbuf, stdout); }
  };
  static _flusher outputFlusher;
  if (pp == pbuf + OUT_BUF) {
    fwrite(pbuf, 1, OUT_BUF, stdout);
    pp = pbuf;
  }
  *pp++ = x;
}
template <typename T>
inline void print_(T x) {
  if (x == 0) {
    IO::myPutchar('0');
    return;
  }
  std::vector<int> num;
  if (x < 0) {
    IO::myPutchar('-');
    x = -x;
  }
  for (; x; x /= 10) {
    num.push_back(x % 10);
  }
  while (!num.empty()) {
    IO::myPutchar(num.back() ^ '0');
    num.pop_back();
  }
}
template <typename T>
inline void print(T x, char ch = '\n') {
  print_(x);
  IO::myPutchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
  if (n == -1) {
    n = strlen(s);
  }
  for (int i = 0; i < n; ++i) {
    IO::myPutchar(s[i]);
  }
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
  printStr_(s, n);
  IO::myPutchar(ch);
}
}  // namespace IO
using namespace IO;
const int N = 200005;
int n, m, a[N];
std::vector<int> E[N];
long long f[N], ans;
std::vector<int> p;
void dfs(int u) {
  f[u] = a[u];
  for (int v : E[u]) {
    dfs(v);
    f[u] += std::max(f[v], 0ll);
  }
  ans += f[u];
}
void getp(int u) {
  for (int v : E[u]) {
    if (f[v] > 0) {
      getp(v);
    }
  }
  p.push_back(u);
  for (int v : E[u]) {
    if (f[v] <= 0) {
      getp(v);
    }
  }
}
void solve() {
  read(n);
  for (int i = 1; i <= n; ++i) {
    E[i].clear();
  }
  for (int i = 1; i <= n; ++i) {
    read(a[i]);
  }
  std::vector<int> rt;
  for (int i = 1; i <= n; ++i) {
    int x;
    read(x);
    if (x != -1) {
      E[x].push_back(i);
    } else {
      rt.push_back(i);
    }
  }
  p.clear();
  for (int v : rt) {
    dfs(v);
    getp(v);
  }
  print(ans);
  for (int v : p) {
    print(v, ' ');
  }
  IO::myPutchar('\n');
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
}
