description: One day, early in the morning, you decided to buy yourself a bag of chips in the nearby store. The store has chips of n different flavors. A bag of the i-th flavor costs a_i burles.
  
  The store may run out of some flavors, so you'll decide which one to buy after arriving there. But there are two major flaws in this plan: 
  
    1. you have only coins of 1, 2 and 3 burles; 
    2. since it's morning, the store will ask you to pay in exact change, i. e. if you choose the i-th flavor, you'll have to pay exactly a_i burles. 
  
  
  
  Coins are heavy, so you'd like to take the least possible number of coins in total. That's why you are wondering: what is the minimum total number of coins you should take with you, so you can buy a bag of chips of any flavor in exact change?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.
  
  The first line of each test case contains the single integer n (1 ≤ n ≤ 100) — the number of flavors in the store.
  
  The second line of each test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the cost of one bag of each flavor.
  
  Output
  
  For each test case, print one integer — the minimum number of coins you need to buy one bag of any flavor you'll choose in exact change.
  
  Example
  
  Input
  
  
  4
  1
  1337
  3
  10 8 10
  5
  1 2 3 4 5
  3
  7 77 777
  
  
  Output
  
  
  446
  4
  3
  260
  
  Note
  
  In the first test case, you should, for example, take with you 445 coins of value 3 and 1 coin of value 2. So, 1337 = 445 ⋅ 3 + 1 ⋅ 2.
  
  In the second test case, you should, for example, take 2 coins of value 3 and 2 coins of value 2. So you can pay either exactly 8 = 2 ⋅ 3 + 1 ⋅ 2 or 10 = 2 ⋅ 3 + 2 ⋅ 2.
  
  In the third test case, it's enough to take 1 coin of value 3 and 2 coins of value 1.
solution: import java.io.*;
  import java.util.*;
  import java.math.*;
  import java.lang.*;
   
  import static java.lang.Math.*;
  
  public class Main implements Runnable {
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
   
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
          
          public int read() {
              if (numChars==-1) 
                  throw new InputMismatchException();
              
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  }
                  catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  
                  if(numChars <= 0)               
                      return -1;
              }
              return buf[curChar++];
          }
       
          public String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          public int nextInt() {
              int c = read();
              
              while(isSpaceChar(c)) 
                  c = read();
              
              int sgn = 1;
              
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              
              int res = 0;
              do {
                  if(c<'0'||c>'9') 
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c)); 
              
              return res * sgn;
          }
          
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
                  return res * sgn;
          }
          
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E')
                      return res * Math.pow(10, nextInt());
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
          
          public String readString() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } 
              while (!isSpaceChar(c));
              
              return res.toString();
          }
       
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
       
          public String next() {
              return readString();
          }
          
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
      public static void main(String args[]) throws Exception {
          new Thread(null, new Main(),"Main",1<<26).start();
      } 
      public int getColor(HashMap<Integer, Integer> map, int i) {
          if(map.containsKey(i))
              return map.get(i);
          return i;
      }
      void solve() {
          InputReader sc = new InputReader(System.in);
          PrintWriter out = new PrintWriter(System.out);
  
          int t = sc.nextInt();
          for(int x = 0; x < t; ++x) {
              int n = sc.nextInt();
  
              int a[] = new int[n];
              for(int i = 0; i < n; ++i)
                  a[i] = sc.nextInt();
  
              int modulo[] = new int[3];
              int pure[] = new int[3];
              for(int i = 0; i < n; ++i) {
                  modulo[a[i] % 3] += 1;
                  if(a[i] < 3)
                      pure[a[i]] += 1;
              }
  
              int pans = 0;
              for(int i = 0; i < n; ++i)
                  pans = max(pans, a[i] / 3);
              if(modulo[1] == 0 && modulo[2] == 0) {
                  out.println(pans);
              }
              else if((modulo[1] > 0 && modulo[2] == 0) || (modulo[1] == 0 && modulo[2] > 0)) {
                  out.println(pans + 1);
              }
              else {
                  pans = 0;
                  for(int i = 0; i < n; ++i) {
                      pans = max(pans, (a[i] - 1) / 3);
                  }
                  if(pure[1] > 0)
                      out.println((pans + 2));
                  else {
                      int cpans = 0;
                      for(int i = 0; i < n; ++i) {
                          if(a[i] % 3 == 1) {
                              cpans = max(cpans, (a[i] - 4) / 3);
                          }
                          else {
                              cpans = max(cpans, a[i] / 3);
                          }
                      }
                      pans = min(pans, cpans);
                      out.println((pans + 2));
                  }
              }
          }
          out.close();
      }
      public void run() {
          solve();
      }
      class Query {
          int type;
          int val1, val2;
          Query(int a, int b) {
              type = a;
              val1 = b;
          }
          Query(int a, int b, int c) {
              type = a;
              val1 = b;
              val2 = c;
          }
      }
  }