#include <bits/stdc++.h>
int main() {
  int n, m, z, l, k, i = 1, j = 1, p = 0, q = 0, count = 0;
  scanf("%d%d%d", &n, &m, &z);
  int a[10000], b[10000];
  while ((i * n) <= z) {
    a[p] = i * n;
    i++;
    p++;
  }
  while ((j * m) <= z) {
    b[q] = j * m;
    j++;
    q++;
  }
  for (k = 0; k < p; k++) {
    for (l = 0; l < q; l++) {
      if (a[k] == b[l]) count++;
    }
  }
  printf("%d\n", count);
  return 0;
}
