// 1つ消して2つ追加できるところをひたすら探す
#include <algorithm>
#include <chrono>
#include <iostream>
#include <random>
#include <tuple>
#include <vector>
using namespace std;

#include <atcoder/dsu>

std::mt19937 rng(159376);

using Tri = tuple<int, int, int>;

int rnd(int n) {
    return uniform_int_distribution<int>(0, n - 1)(rng);
}

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    auto START = std::chrono::system_clock::now();

    int N, M;
    cin >> N >> M;
    vector<Tri> edges;
    for (int i = 0; i < M; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        u--, v--, w--;
        edges.emplace_back(u, v, w);
    }
    std::shuffle(edges.begin(), edges.end(), rng);

    vector<int> best_solution;
    for (int h = 0; h < M; h++) {
        vector<int> tmp;
        atcoder::dsu uf(N);
        for (int t = 0; t < M; t++) {
            int i = (h + t) % M;
            auto [u, v, w] = edges[i];
            if (!uf.same(u, v) and !uf.same(v, w) and !uf.same(u, w)) {
                uf.merge(u, v), uf.merge(v, w);
                tmp.emplace_back(i);
            }
        }
        if (best_solution.size() < tmp.size()) best_solution = tmp;
    }

    vector<int> is_in(M);
    for (auto i : best_solution) is_in[i] = 1;

    int ret = accumulate(is_in.begin(), is_in.end(), 0);

    while (true) {
        int64_t spent_ms = std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now() - START).count();
        if (spent_ms > 900) break;

        int i = rnd(M), j = rnd(M), k = rnd(M);
        if (i == j or j == k or k == i or is_in[i] + is_in[j] + is_in[k] != 1) continue;
        is_in[i] ^= 1;
        is_in[j] ^= 1;
        is_in[k] ^= 1;
        atcoder::dsu uf(N);
        bool good = true;
        for (int e = 0; e < M; e++) {
            if (!is_in[e]) continue;
            auto [u, v, w] = edges[e];
            if (uf.same(u, v) or uf.same(v, w) or uf.same(w, u)) {
                good = false;
                break;
            }
            uf.merge(u, v), uf.merge(v, w);
        }
        if (good) {
            ret++;
            cerr << "Improved: " << ret << endl;
        } else {
            is_in[i] ^= 1;
            is_in[j] ^= 1;
            is_in[k] ^= 1;
        }
    }
    cout << ret << '\n';
}