#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 104857601;


const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int > w(N), len(N);
  for(int i = 0; i < N; i++) {
    string s;
    cin >> s;
    len[i] = (int) s.size();
    for(int j = s.size() - 1; j >= 0; j--) {
      w[i] <<= 1;
      w[i] |= s[j] == '1';
    }
  }

  auto dp = make_v< int64 >(1 << 17, 17);
  fill_v(dp, infll);
  using pi = tuple< int64, int, int >;
  priority_queue< pi, vector< pi >, greater<> > que;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      if(i == j) continue;
      if(len[i] >= len[j]) continue;

      // len[i] < len[j]
      int d = (len[j] - len[i]);
      if(w[i] ^ (w[j] >> d)) continue;
      int nxt = w[j] & ((1 << d) - 1);
      if(chmin(dp[nxt][d], len[j])) que.emplace(dp[nxt][d], nxt, d);
    }
  }


  int64 uku = infll;

  while(que.size()) {
    int64 cost;
    int bit, sz;
    tie(cost, bit, sz) = que.top();
    que.pop();

    for(int i = 0; i < N; i++) {
      if(sz + len[i] <= 16) {
        int nxt = (bit << len[i]) | w[i];
        if(chmin(dp[nxt][sz + len[i]], cost + len[i])) {
          que.emplace(dp[nxt][sz + len[i]], nxt, sz + len[i]);
        }
      }
    }

    for(int i = 0; i < N; i++) {
      if(len[i] < sz) {
        if((bit >> (sz - len[i])) ^ w[i]) continue;
        int nxt = bit & ((1 << (sz - len[i])) - 1);
        if(chmin(dp[nxt][sz - len[i]], cost)) {
          que.emplace(dp[nxt][sz - len[i]], nxt, sz - len[i]);
        }
      } else if(len[i] == sz) {
        if(bit ^ w[i]) continue;
        chmin(uku, cost);
      } else {
        if((w[i] >> (len[i] - sz)) ^ bit) continue;
        int nxt = w[i] & ((1 << (len[i] - sz)) - 1);
        if(chmin(dp[nxt][len[i] - sz], cost + len[i] - sz)) {
          que.emplace(dp[nxt][len[i] - sz], nxt, len[i] - sz);
        }
      }
    }

  }

  if(uku == infll) cout << 0 << endl;
  else cout << uku << endl;

}


Measured memory_bytes: 25360