Double Hashing For Inserting Integer Into Hashtable

I'm having a problem with double hashing, its supposed to have the user insert an integer into the table and the integer is hashed into the table by the mod of the size of the table so say for instance table size 10 I insert 89 that inserts into 9 because 89%10=9 then i insert 18 that goes into 8 but then once i insert 69 its supposed to collide with index 9 and then uses 7-(69%7) for prime number double hashing...but it just goes into index 9 instead so in 9 it puts 89,69...there's no errors just the wrong output

System.out.print("Enter size of table: ");
int n = input.nextInt();
size=n;
a = new ArrayList[size];
for (int i = 0; i < size; i++) {
a[i] = new ArrayList<Integer>();

[code]....