Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		s := io.NextLine()
		if s == "." {
			break
		}
		t := io.NextLine()
		if s == t {
			io.Println("IDENTICAL")
			continue
		}
		ss := strings.Split(s, "\"")
		tt := strings.Split(t, "\"")
		if len(ss) != len(tt) {
			io.Println("DIFFERENT")
			continue
		}
		cnt := 0
		for i := 0; i < len(ss); i++ {
			if i%2 == 0 {
				if ss[i] != tt[i] {
					cnt = -1
					break
				}
			} else {
				if ss[i] != tt[i] {
					cnt++
				}
			}
		}
		if cnt > 1 || cnt == -1 {
			io.Println("DIFFERENT")
		} else {
			io.Println("CLOSE")
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <string>
#include <vector>
using namespace std;

int main(){

  while(true){
    int wrongTime = 0;
    string str_in;
    string str_ans;
    vector <string> sub_in;
    vector <string> sub_ans;
    //input--------------------
    cin >> str_in;
    if( str_in == ".") break;
    cin>> str_ans;
    //split---------------------
    int start = 0;
    for(int i=0; i < str_in.size() ; i++){
      if(str_in[i] == '\"') {
        sub_in.push_back(str_in.substr(start,i-start));
        start = i+1;
      }
    }
    start = 0;
    for(int i=0; i < str_ans.size() ; i++){
      if(str_ans[i] == '\"') {
        sub_ans.push_back(str_ans.substr(start,i-start));
        start = i+1;
      }
    }

    if(sub_in.size() == 0) sub_in.push_back(str_in);
    if(sub_ans.size() == 0) sub_ans.push_back(str_ans);
    //split check
      // for(int i = 0; i < sub_in.size(); i++) cout << sub_in[i] << endl;
      // for(int i = 0; i < sub_ans.size(); i++) cout << sub_ans[i] << endl;
    //conpare
    if(sub_in.size() != sub_ans.size()){
      wrongTime = 2;
    }else{
      wrongTime = 0;
      for(int i = 0; i < sub_in.size(); i++){
        if(i%2 == 1){
          if(sub_in[i] != sub_ans[i]) wrongTime ++;
        }else{
          if(sub_in[i] != sub_ans[i]) wrongTime += 2;
        }
      }
    }
    if(wrongTime == 0) cout << "IDENTICAL" << endl;
    else if(wrongTime <= 1) cout << "CLOSE" << endl;
    else cout << "DIFFERENT" << endl;
    sub_in.clear();
    sub_ans.clear();
  }

  return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int main(){

  string s1,s2;
  bool t = false;

  while(1){
	int cnt = 0;
	cin>>s1;

	if(s1==".")
	  break;

	cin>>s2;

	if(s1==s2){
	  cout<<"IDENTICAL"<<endl;
	  continue;
	}

	else{
	  int i=0;
	  int j=0;
	  t = false;
	  
	  while(1){
		cout<<i<<" "<<j<<endl;

		if(s1[i]=='\0' &&  s2[j]=='\0')
		  break;
		
		if(s1[i]!=s2[j]){
		  cout<<"DIFFERENT"<<endl;
		  t = true;
		  break;
		}
		
		if(s1[i]=='\"' && s2[j]=='\"'){
		  i++;
		  j++;
		  
		  while(1){
			cout<<3<<endl;
			if(s1[i]=='\"' && s2[j]=='\"')
			  break;
			
			if(s1[i]!=s2[j]){
			  cnt++;
			  while(s1[i]!='\"')
				i++;
			  while(s2[j]!='\"')
				j++;
			  break;
			}
			i++;
			j++;
		  } 
		}
		  i++;
		  j++;
	  }
	  if(t == true)
		continue;
	}
	if(cnt == 1)
	  cout<<"CLOSE"<<endl;
	else
	  cout<<"DEFFERENT"<<endl;
  }
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;

enum RESULT{
	IDENTICAL,
	CLOSE,
	DIFFERENT,
};

struct Info{
	char name[201];
};

bool strCmp(char* base, char* comp){
	int length1 = 0,length2 = 0;
	for(int i=0;base[i] != '\0'; i++)length1++;
	for(int i=0;comp[i] != '\0'; i++)length2++;
	if(length1 != length2)return false;

	for(int i=0;base[i] != '\0'; i++){
		if(base[i] != comp[i])return false;
	}
	return true;
}

void strcpy(char* to,char* str){
	for(int i=0;str[i] != '\0';i++){
		to[i] = str[i];
		to[i+1] = '\0';
	}
}

RESULT compare(char left[201],char right[201]){

	if(strCmp(left,right))return IDENTICAL;

	char content[201],work[201];
	int content_index,work_index = 0;

	queue<Info> N_L_Q,N_R_Q;
	queue<Info> L_Q,R_Q;

	//left
	for(int i = 0; left[i] != '\0'; ){
		if(left[i] != '"'){
			work[work_index++] = left[i];
			i++;

			if(left[i] == '\0'){
				work[work_index] = '\0';
				Info info;
				strcpy(info.name,work);
				N_L_Q.push(info);
				work_index = 0;
			}

		}else{

			if(work_index > 0){
				work[work_index] = '\0';
				Info info;
				strcpy(info.name,work);
				N_L_Q.push(info);
				work_index = 0;
			}

			content_index = 0;
			for(++i;left[i] != '"';i++){
				content[content_index++] = left[i];
			}
			if(content_index > 0){
				content[content_index] = '\0';
			}else{
				content[0] = '.';
				content[1] = '\0';
			}
			Info info;
			strcpy(info.name,content);
			L_Q.push(info);
			i++;
		}
	}

	//right
	for(int i = 0; right[i] != '\0'; ){
		if(right[i] != '"'){
			work[work_index++] = right[i];
			i++;

			if(right[i] == '\0'){
				work[work_index] = '\0';
				Info info;
				strcpy(info.name,work);
				N_R_Q.push(info);
				work_index = 0;
			}
		}else{

			if(work_index > 0){
				work[work_index] = '\0';
				Info info;
				strcpy(info.name,work);
				N_R_Q.push(info);
				work_index = 0;
			}

			content_index = 0;
			for(++i;right[i] != '"';i++){
				content[content_index++] = right[i];
			}
			if(content_index > 0){
				content[content_index] = '\0';
			}else{
				content[0] = '.';
				content[1] = '\0';
			}
			Info info;
			strcpy(info.name,content);
			R_Q.push(info);
			i++;
		}
	}

	int num = 0;

	if(N_R_Q.size() != N_L_Q.size()){
		return DIFFERENT;
	}

	while(!N_R_Q.empty()){
		if(!strCmp(N_R_Q.front().name,N_L_Q.front().name)){
			num++;
			break;
		}
		N_R_Q.pop();
		N_L_Q.pop();
	}

	if(num != 0){
		return DIFFERENT;
	}


	if(R_Q.size() != L_Q.size())return DIFFERENT;
	num = 0;

	while(!L_Q.empty()){
		if(!strCmp(L_Q.front().name,R_Q.front().name))num++;
		L_Q.pop();
		R_Q.pop();
	}

	if(num == 1){
		return CLOSE;
	}else{
		return DIFFERENT;
	}
}


int main(){

	char left[201],right[201];
	while(true){
		scanf("%s",left);
		if(left[0] == '.')break;

		scanf("%s",right);

		switch(compare(left,right)){
		case IDENTICAL:
			printf("IDENTICAL\n");
			break;
		case CLOSE:
			printf("CLOSE\n");
			break;
		case DIFFERENT:
			printf("DIFFERENT\n");
			break;
		}
	}

	return 0;
}