// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int[] solution(int[] A) {
        // write your code in Java SE 8
    }
}

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
}

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 1; i <= 2 * N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 1; i <= 2 * N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 0; i < N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 0; i < N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 0; i < N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const N = A.length;
  const counter = new Array(2 * N + 1).fill(0);
  for (let i = 0; i < N; i++) {
    counter[A[i]]++;
  }
  const nonDivisors = [];
  for (let i = 0; i < N; i++) {
    let nDivisors = 0;
    for (let j = 1; j * j <= A[i]; j++) {
      if (A[i] % j === 0) {
        nDivisors += counter[j];
        if (j * j !== A[i]) nDivisors += counter[A[i] / j];
      }
    }
    nonDivisors.push(N - nDivisors);
  }
  return nonDivisors;
}