#include <iostream> #include <algorithm> #define llIlllllIllllIIIIIlllIIII sort using namespace std; int a[100005]; int main() { int llIlllllIllllIIIIIlllIIII; cin >> llIlllllIllllIIIIIlllIIII; int IIIIlllIIIIlIIIllII(0); for (int i = 1; i <= llIlllllIllllIIIIIlllIIII; i++) cin >> a[i], a[i] %= 3, IIIIlllIIIIlIIIllII = (IIIIlllIIIIlIIIllII + a[i]) % 3; IIIIlllIIIlllIIIIIl(a + 1, a + llIlllllIllllIIIIIlllIIII + 1); int i(1); for (; i <= llIlllllIllllIIIIIlllIIII; i++) if (a[i]) break; int j(i); for (; j <= llIlllllIllllIIIIIlllIIII; j++) if (a[j] == 2) break; int IIIIllIIIIlllllllIIllllll(n); if (!IIIIlllIIIIlIIIllII) cout << IIIIllIIIIlllllllIIllllll; else if (!(IIIIlllIIIIlIIIllII-1)) { if (a[i] == 1) { cout << IIIIllIIIIlllllllIIllllll - 1; } else { cout << IIIIllIIIIlllllllIIllllll - 2; } } else { if (j > n) { cout << IIIIllIIIIlllllllIIllllll - 2; } else { cout << IIIIllIIIIlllllllIIllllll - 1; } } }